Problem: Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:

* update(s, t, x): change as, as+1, ..., at to x.
* find(s, t): report the minimum element in as, as+1, ..., at.



Note that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* 0 ≤ s ≤ t < n
* 0 ≤ x < 231−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 queryi 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.

Examples

Input

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


Output

1
2


Input

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


Output

2147483647
5

Solution (in CPP):

Solution:
#include<iostream>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
long long seg[1 << 19], seg2[1 << 19], n, v, a, b, c, d, INF = (1LL << 31) - 1, size_ = 1;

void push(int u) {
	if (seg[u] == INF)return;
	seg[u * 2] = seg[u]; seg[u * 2 + 1] = seg[u];
	seg2[u * 2] = seg2[u]; seg2[u * 2 + 1] = seg2[u];
	seg[u] = INF;
}
void update(int p, int q, int r, int s, int t, int u) {
	if (s <= p || q <= r)return;
	if (p <= r && s <= q) { seg[u] = t; seg2[u] = t; return; }
	push(u);
	update(p, q, r, (r + s) / 2, t, u * 2);
	update(p, q, (r + s) / 2, s, t, u * 2 + 1);
	seg2[u] = min(seg2[u * 2], seg2[u * 2 + 1]);
}
long long query(long long p, long long q, long long r, long long s, long long u) {
	if (s <= p || q <= r)return INF;
	if (p <= r && s <= q)return seg2[u];
	push(u);
	return min(query(p, q, r, (r + s) / 2, u * 2), query(p, q, (r + s) / 2, s, u * 2 + 1));
}
int main() {
	cin >> n >> v; while (size_ < n)size_ *= 2;
	for (int i = 1; i <= size_ * 2; i++) { seg[i] = INF; seg2[i] = INF; }
	for (int i = 1; i <= v; i++) {
		scanf("%d", &a);
		if (a == 0) { scanf("%lld%lld%lld", &b, &c, &d); c++; update(b, c, 0, size_, d, 1); }
		if (a == 1) { scanf("%lld%lld", &b, &c); c++; printf("%lld\n", query(b, c, 0, size_, 1)); }
	}
	return 0;
}