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 <bits/stdc++.h>
using namespace std;

const int MAXn = 200005, MAX = 2147483647;
int n, q, t1, t2, t3, t4, h, d[MAXn], t[MAXn];
bool tag[MAXn];

int msb(int val) {
	int i = 0;
	while(val) val >>= 1, i++;
	return i;
}

void apply(int p, int val) {
	t[p] = val;
	if (p < n) d[p] = val, tag[p] = 1;
}

void build(int p) {
	while(p > 1) {
		p >>= 1;
		if (tag[p]) t[p] = d[p];
		else t[p] = min(t[p << 1], t[p << 1 | 1]);
	}
}

void push(int p) {
	for (int s = h - 1; s > 0; s--) {
		int i = p >> s;
		if (tag[i]) {
			apply(i << 1, d[i]);
			apply(i << 1 | 1, d[i]);
			tag[i] = 0;
		}
	}
}

void modify(int l, int r, int val) {
	l += n, r += n;
	int l0 = l, r0 = r;
	push(l);
	push(r - 1);
	for (; l < r; l >>= 1, r >>= 1) {
		if (l & 1) apply(l++, val);
		if (r & 1) apply(--r, val);
	}
	build(l0);
	build(r0 - 1);
}

int query(int l, int r) {
	l += n, r += n;
	push(l);
	push(r - 1);
	int ans = MAX;
	for (; l < r; l >>= 1, r >>= 1) {
		if (l & 1) ans = min(ans, t[l++]);
		if (r & 1) ans = min(ans, t[--r]);
	}
	return ans;
}

int main() {
	cin >> n >> q;
	h = msb(n);
	for (int i = 1; i < 2 * n; i++) t[i] = MAX;
	for (int i = 0; i < q; i++) {
		cin >> t1;
		if (t1 == 0) {
			cin >> t2 >> t3 >> t4;
			modify(t2, t3 + 1, t4);
		}
		else {
			cin >> t2 >> t3;
			cout << query(t2, t3 + 1) << endl;
		}
	}
}