{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eThere are $n$ points in an array with index from $1$ to $n$, and there are two operations to those points.\u003c/p\u003e\n\u003cp\u003e1: $1 \\ x$ marking the point $x$ is not available\u003c/p\u003e\n\u003cp\u003e2: $2 \\ x$ query for the index of the first available point after that point (including $x$ itself) .\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\u003c/p\u003e\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003e$n\\quad q$\u003c/p\u003e\n\u003cp\u003e$z_1 \\quad x_1$\u003c/p\u003e\n\u003cp\u003e$\\vdots$\u003c/p\u003e\n\u003cp\u003e$z_q\\quad x_q$\u003c/p\u003e\n\u003cp\u003e$q$ is the number of queries, $z$ is the type of operations, and $x$ is the index of operations. $1≤x\u0026lt;n\u0026lt;10^9$, $1 \\leq q\u0026lt;10^6 $ and $z$ is $1$ or $2$\u003c/p\u003e\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003eOutput the answer for each query.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 3\n1 2\n2 2\n2 1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\n1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr /\u003e"}}]}