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;

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

const int BUCKET = 400,SIZE = 300;
int N,Q;
bool updateFlag [BUCKET];
ll lazyUpdate [BUCKET];
ll bucketMin [BUCKET];
ll A [100000];
const ll INF = (1ll << 31) - 1;

void update(int l,int r,ll val)
{
	FOR(i,0,BUCKET){
		int bucketL = i * SIZE,bucketR = (i + 1) * SIZE;
		if(r <= bucketL || bucketR <= l) continue;
		if(l <= bucketL && bucketR <= r){
			lazyUpdate [i] = val;
			updateFlag [i] = true;
			continue;
		}
		if(updateFlag [i]){
			FOR(j,bucketL,bucketR){
				A [j] = lazyUpdate [i];
			}
			updateFlag [i] = false;
		}
		bucketMin [i] = INF;
		FOR(j,bucketL,bucketR){
			if(l <= j && j < r){
				A [j] = val;
			}
			chmin(bucketMin [i],A [j]);
		}
	}
}

ll getMin(int l,int r)
{
	ll res = INF;
	FOR(i,0,BUCKET){
		int bucketL = i * SIZE,bucketR = (i + 1) * SIZE;
		if(r <= bucketL || bucketR <= l) continue;
		if(l <= bucketL && bucketR <= r){
			if(updateFlag [i]){
				chmin(res,lazyUpdate [i]);
			}
			else{
				chmin(res,bucketMin [i]);
			}
			continue;
		}
		if(updateFlag [i]){
			FOR(j,bucketL,bucketR){
				A [j] = lazyUpdate [i];
			}
			updateFlag [i] = false;
		}
		bucketMin [i] = INF;
		FOR(j,bucketL,bucketR){
			if(l <= j && j < r){
				chmin(res,A [j]);
			}
			chmin(bucketMin [i],A [j]);
		}
	}
	return res;
}

int main()
{
	scanf("%d%d",&N,&Q);
	vector<ll> ans;
	fill(A,A + N,INF);
	fill(bucketMin,bucketMin + BUCKET,INF);
	FOR(i,0,Q){
		int com;
		scanf("%d",&com);
		if(com == 0){
			int s,t,x;
			scanf("%d%d%d",&s,&t,&x);
			update(s,t + 1,x);
		}
		else{
			int s,t;
			scanf("%d%d",&s,&t);
			ans.push_back(getMin(s,t + 1));
		}
	}

	FOR(i,0,ans.size()){
		printf("%lld\n",ans [i]);
	}

	return 0;
}