There is an array of $n$ booleans, initially filled with zeros. You need to write a data structure that processes two types of queries:

• change the value of all elements on a segment from $l$ to $r−1$ to the opposite,
• find the index of the $k$-th one.

The first line contains two numbers $n, m\ (1≤n,m≤100,000)$, the size of the array and the number of operations. 

The following lines contain the description of the operations. The description of each operation is as follows:

• 1 l r: change the value of all elements on a segment from $l$ to $r−1$ to the opposite $(0≤l<r≤n)$,
• 2 k: the index of the $k$-th one (ones are numbered from 0, it is guaranteed that there are enough ones in the array).

For each operation of the second type, print the index of the corresponding one (all indices in this problem are from 0).