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

• for all $i$ from $l$ to $r−1$ do the operation $a_i=\text{max}(a_i,v)$,
• find the current value of element $i$.

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 v: for all $i$ from $l$ to $r−1$ do the operation $a_i=\text{max}(a_i,v)\ (0≤l<r≤n,\ 0≤v≤10^9)$.
• 2 i: find the value of the element with index $i\ (0≤i<n)$.

For each operation of the second type, print the corresponding value.