Suppose that $13$ cards numbered $1, 2, 3, \ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on the fourth pass, and $11, 12, 13$ on the fifth pass. For how many of the $13!$ possible orderings of the cards will the $13$ cards be picked up in exactly two passes?
假设有13张编号为$1, 2, 3, \ldots, 13$的卡片排成一排。任务是按数字递增顺序从左到右反复捡拾它们。在下面的例子中,第一遍捡起卡片$1, 2, 3$,第二遍捡起$4$和$5$,第三遍捡起$6$,第四遍捡起$7, 8, 9, 10$,第五遍捡起$11, 12, 13$。在13!种可能的卡片排列中,有多少种排列会在恰好两次捡拾中捡起所有13张卡片?