{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"There is a binary array $A$ of length $10^5$, consisting of zeroes and ones. You can ask queries about subarray sums. On a query $1 \\leq l \\leq r \\leq 10^5$, you get the sum $A_l + A_{l + 1} + \\ldots + A_r$. You can ask a maximum of $90000$ queries. Find the array $A$.\n\nDon\u0027t forget to flush the standard output after printing each line. It can be done using fflush(stdout) in C/C++, System.out.flush() in Java and sys.stdout.flush() in Python.\n\nIf you exceed $90000$ queries OR the $l, r$ asked in a query don\u0027t satisfy $1 \\leq l \\leq r \\leq 10^5$, OR the array found by you in the end is not the same as array $A$, your program will get Wrong Answer. The input is fixed and the judge is not adaptive.\n\n\n\n### Input and Output:\nTo ask for the sum of the subarray from $l$ to $r$ output $1$ $l$ $r$. Once you know the array $A$, print $2$ $A_1$ $A_2 \\cdots A_{10^5}$.\n\nBelow is a sample interaction. For the sake of explanation, the array size is assumed to be $4$ here instead of $10^5$. The hidden array $A$ is $[1, 1, 0, 1]$\n\n\n\n### Sample Input and Output:\n```\nInput / Judge Feedback Your output / Your query\n\n 1 2 2\n1\n 1 1 2\n2\n 1 1 4\n3\n 1 3 3\n0\n 2 1 1 0 1\n```\n\n\n\t\n### EXPLANATION:\nAccording to the asked queries, $A_2 \u003d 1$, $A_1 + A_2 \u003d 2$, $A_1 + A_2 + A_3 + A_4 \u003d 3$, $ A_3 \u003d 0$. The only binary array $A$ that satisfies these equations is $[1, 1, 0, 1]$\n"}}]}