6703：array

You are given an array $a_1,a_2,...,a_n (\forall i \in [1, n], 1 \leq a_i\leq n)$. Initially, each element of the array is **unique**.

Moreover, there are $m$ instructions.

Each instruction is in one of the following two formats:

1. $(1,pos)$,indicating to change the value of $a_{pos}$ to $a_{pos}+10,000,000$;
2. $(2,r,k)$,indicating to ask the minimum value which is **not equal** to any $a_i$ ( $1 \leq i \leq r$ ) and **not less ** than $k$.

Please print all results of the instructions in format $2$.

The first line of the input contains an integer $T(1 \leq T \leq 10)$, denoting the number of test cases.

In each test case, there are two integers $n(1 \leq n \leq 100,000)$,$m(1 \leq m \leq 100,000)$ in the first line, denoting the size of array $a$ and the number of instructions.

In the second line, there are $n$ distinct integers $a_1,a_2,...,a_n$ $(\forall i \in [1, n], 1 \leq a_i\leq n)$,denoting the array.
For the following $m$ lines, each line is of format $( 1 , t1 )$ or $( 2 , t2 , t3 )$.
The parameters of each instruction are generated by such way :

For instructions in format $1$ , we defined $pos = t1 \oplus LastAns$ . (It is promised that $1 \leq pos \leq n$)

For instructions in format $2$ , we defined $r = t2 \oplus LastAns , k = t3 \oplus LastAns$. (It is promised that $1 \leq r \leq n , 1 \leq k \leq n$ )

(Note that $\oplus$ means the bitwise XOR operator. )

Before the first instruction of each test case, $LastAns$ is equal to $0$ .After each instruction in format $2$, $LastAns$ will be changed to the result of that instruction.

($\sum n \leq 510,000 , \sum m \leq 510,000 $ )

For each instruction in format $2$, output the answer in one line.