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>
#define For(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); (i)--)
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
template<class T> struct LazySegTree{
    int n = 1;
    int initv;
    vector<T> node, lazy;
    vector<bool> flag;

    LazySegTree(int n_, T initv_){
        while(n < n_) n *= 2;
        initv = initv_;
        node.resize(2*n-1, initv);
        lazy.resize(2*n-1, 0);
        flag.resize(2*n-1, false);
    }

    void eval(int i, int l, int r){
        if(!flag[i]) return;
        node[i] = lazy[i];
        if(r - l > 1){
            lazy[i*2+1] = lazy[i];
            flag[i*2+1] = true;
            lazy[i*2+2] = lazy[i];
            flag[i*2+2] = true;
        }
        flag[i] = false;
        lazy[i] = 0;
    }

    void update(int a, int b, int i, T x, int l, int r){
        eval(i, l, r);
        if(r<=a || b<=l) return;
        if(a<=l && r<=b){
            lazy[i] = x;
            flag[i] = true;
            eval(i, l, r);
            return;
        }
        update(a, b, i*2+1, x, l, (l+r)/2);
        update(a, b, i*2+2, x, (l+r)/2, r);
        node[i] = min(node[i*2+1], node[i*2+2]);
    }

    T getmin(int a, int b, int i, int l, int r){
        eval(i, l, r);
        if(r<=a || b<=l) return initv;
        if(a<=l && r<=b) return node[i];
        T vl = getmin(a, b, i*2+1, l, (l+r)/2);
        T vr = getmin(a, b, i*2+2, (l+r)/2, r);
        return min(vl, vr);
    }
};

int main(){
    int n, q; cin >> n >> q;
    LazySegTree<int> lst(n, INT_MAX);
    rep(i, q){
        int c; cin >> c;
        if(c){
            int s, t; cin >> s >> t;
            cout << lst.getmin(s, t+1, 0, 0, lst.n) << endl;
        }
        else{
            int s, t, x; cin >> s >> t >> x;
            lst.update(s, t+1, 0, x, 0, lst.n);
        }
    }
}