RMQ and RUQ

Write a program which manipulates a sequence A = {a₀, a₁, . . . , 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³¹-1.

Input

n q
query1
query2
:
queryq

In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query query_i is given in the following format:

0 s t x 

or

1 s t

The first digit represents the type of the query. '0' denotes update(s, t, x) and '1' denotes find(s, t).

Output

For each find operation, print the minimum value.

Constraints

• 1 ≤ n ≤ 100000
• 1 ≤ q ≤ 100000
• 0 ≤ s ≤ t < n
• 0 ≤ x < 2³¹−1

Sample Input 1

3 5
0 0 1 1
0 1 2 3
0 2 2 2
1 0 2
1 1 2

Sample Output 1

1
2

Sample Input 2

1 3
1 0 0
0 0 0 5
1 0 0

Sample Output 2

2147483647
5