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

• apply the operation $a_i=a_i|v$ (bitwise OR) to all elements from $l$ to $r−1$
• find bitwise AND of elements in the range from $l$ to $r−1$.

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: apply the operation $a_i=a_i|v$ (bitwise OR) to all elements from $l$ to $r−1\ (0≤l<r≤n,\ 0≤v<2^{30})$.
• 2 l r: find bitwise AND of elements in the range from $l$ to $r−1\ (0≤l<r≤n)$.