{"status": "success", "data": {"description_md": "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?<br><center><img class=\"problem-image\" alt='[asy] size(11cm); draw((0,0)--(2,0)--(2,3)--(0,3)--cycle); label(\"7\", (1,1.5)); draw((3,0)--(5,0)--(5,3)--(3,3)--cycle); label(\"11\", (4,1.5)); draw((6,0)--(8,0)--(8,3)--(6,3)--cycle); label(\"8\", (7,1.5)); draw((9,0)--(11,0)--(11,3)--(9,3)--cycle); label(\"6\", (10,1.5)); draw((12,0)--(14,0)--(14,3)--(12,3)--cycle); label(\"4\", (13,1.5)); draw((15,0)--(17,0)--(17,3)--(15,3)--cycle); label(\"5\", (16,1.5)); draw((18,0)--(20,0)--(20,3)--(18,3)--cycle); label(\"9\", (19,1.5)); draw((21,0)--(23,0)--(23,3)--(21,3)--cycle); label(\"12\", (22,1.5)); draw((24,0)--(26,0)--(26,3)--(24,3)--cycle); label(\"1\", (25,1.5)); draw((27,0)--(29,0)--(29,3)--(27,3)--cycle); label(\"13\", (28,1.5)); draw((30,0)--(32,0)--(32,3)--(30,3)--cycle); label(\"10\", (31,1.5)); draw((33,0)--(35,0)--(35,3)--(33,3)--cycle); label(\"2\", (34,1.5)); draw((36,0)--(38,0)--(38,3)--(36,3)--cycle); label(\"3\", (37,1.5)); [/asy]' class=\"latexcenter\" height=\"45\" src=\"https://latex.artofproblemsolving.com/6/e/9/6e932ec00fe0f762da98425d4ce220c09f53bc99.png\" width=\"522\"/></center>\n\n$\\textbf{(A) } 4082 \\qquad \\textbf{(B) } 4095 \\qquad \\textbf{(C) } 4096 \\qquad \\textbf{(D) } 8178 \\qquad \\textbf{(E) } 8191$\n___\nFull credit goes to [MAA](https://maa.org/) for authoring these problems. These problems were taken on the [AOPS](https://artofproblemsolving.com/) website.", "description_html": "<p>Suppose that  <span class=\"katex--inline\">13</span>  cards numbered  <span class=\"katex--inline\">1, 2, 3, \\ldots, 13</span>  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  <span class=\"katex--inline\">1, 2, 3</span>  are picked up on the first pass,  <span class=\"katex--inline\">4</span>  and  <span class=\"katex--inline\">5</span>  on the second pass,  <span class=\"katex--inline\">6</span>  on the third pass,  <span class=\"katex--inline\">7, 8, 9, 10</span>  on the fourth pass, and  <span class=\"katex--inline\">11, 12, 13</span>  on the fifth pass. For how many of the  <span class=\"katex--inline\">13!</span>  possible orderings of the cards will the  <span class=\"katex--inline\">13</span>  cards be picked up in exactly two passes?<br/><center><img class=\"latexcenter\" alt=\"[asy] size(11cm); draw((0,0)--(2,0)--(2,3)--(0,3)--cycle); label(&#34;7&#34;, (1,1.5)); draw((3,0)--(5,0)--(5,3)--(3,3)--cycle); label(&#34;11&#34;, (4,1.5)); draw((6,0)--(8,0)--(8,3)--(6,3)--cycle); label(&#34;8&#34;, (7,1.5)); draw((9,0)--(11,0)--(11,3)--(9,3)--cycle); label(&#34;6&#34;, (10,1.5)); draw((12,0)--(14,0)--(14,3)--(12,3)--cycle); label(&#34;4&#34;, (13,1.5)); draw((15,0)--(17,0)--(17,3)--(15,3)--cycle); label(&#34;5&#34;, (16,1.5)); draw((18,0)--(20,0)--(20,3)--(18,3)--cycle); label(&#34;9&#34;, (19,1.5)); draw((21,0)--(23,0)--(23,3)--(21,3)--cycle); label(&#34;12&#34;, (22,1.5)); draw((24,0)--(26,0)--(26,3)--(24,3)--cycle); label(&#34;1&#34;, (25,1.5)); draw((27,0)--(29,0)--(29,3)--(27,3)--cycle); label(&#34;13&#34;, (28,1.5)); draw((30,0)--(32,0)--(32,3)--(30,3)--cycle); label(&#34;10&#34;, (31,1.5)); draw((33,0)--(35,0)--(35,3)--(33,3)--cycle); label(&#34;2&#34;, (34,1.5)); draw((36,0)--(38,0)--(38,3)--(36,3)--cycle); label(&#34;3&#34;, (37,1.5)); [/asy]\" height=\"45\" src=\"https://latex.artofproblemsolving.com/6/e/9/6e932ec00fe0f762da98425d4ce220c09f53bc99.png\" width=\"522\"/></center></p>&#10;<p> <span class=\"katex--inline\">\\textbf{(A) } 4082 \\qquad \\textbf{(B) } 4095 \\qquad \\textbf{(C) } 4096 \\qquad \\textbf{(D) } 8178 \\qquad \\textbf{(E) } 8191</span> </p>&#10;<hr><p>Full credit goes to <a href=\"https://maa.org/\">MAA</a> for authoring these problems. These problems were taken on the <a href=\"https://artofproblemsolving.com/\">AOPS</a> website.</p>", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 3, "problem_name": "2022 AMC 12A Problem 19", "can_next": true, "can_prev": true, "nxt": "/problem/22_amc12A_p20", "prev": "/problem/22_amc12A_p18"}}