Minimum on the segment

Write a program which manipulates a sequence $A=\{a_0,a_1,...,a_{n-1}\}$ with the following operations:

• $update(s,t,x)$: change $a_s,a_{s+1},...,a_t$ to $x$.

• $find(s,t)$: report the minimum element in $a_s,a_{s+1},...,a_t$.

Note that the initial values of $a_i(i=0,1,...,n-1)$ are $2^{31}-1$.

Input

The first line contains the number $n(1\le n\le 10^5)$ of elements in $A$ and the number $q(1\le q\le 10^5)$ of queries.

Then, the $i$-th query is given in one of the following format:

• $0stx$

• $1st$

The first digit represents the type of the query: $0$ denotes $update(s,t,x)$ and $1$ denotes $find(s,t)$. It is known that $0\le s\le t<n,0\le x<2^{31}-1$.

Output

For each $find$ operation, print the minimum value on a separate line.

Examples