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>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()

int size = 1;
long MAX = (1l << 31) - 1;
vector<long> segtree, lazy;

void eval(int l, int r, int now){
    if(lazy[now] != -1){
        if(r - l > 1){
            lazy[now * 2 + 1] = lazy[now];
            lazy[now * 2 + 2] = lazy[now];
        }
        segtree[now] = lazy[now];
        lazy[now] = -1;
    }
}

void change(int a, int b, long x, int l, int r, int now){
    eval(l, r, now);
    if(r <= a || b <= l){
        return;
    }else if(a <= l && r <= b){
        lazy[now] = x;
        eval(l, r, now);
    }else{
        change(a, b, x, l, (l + r) / 2, now * 2 + 1);
        change(a, b, x, (l + r) / 2, r, now * 2 + 2);
        segtree[now] = min(segtree[now * 2 + 1], segtree[now * 2 + 2]);
    }
}

long minimum(int a, int b, int l, int r, int now){
    eval(l, r, now);
    if(r <= a || b <= l){
        return MAX;
    }else if(a <= l && r <= b){
        return segtree[now];
    }else{
        return min(minimum(a, b, l, (l + r) / 2, now * 2 + 1), minimum(a, b, (l + r) / 2, r, now * 2 + 2));
    }
}

int main(){
    int n, q;
    cin >> n >> q;
    while(size < n){
        size *= 2;
    }
    segtree.resize(size * 2 - 1, MAX);
    lazy.resize(size * 2 - 1, -1);
    for(int i = 0; i < q; i++){
        int com;
        cin >> com;
        if(com){
            int s, t;
            cin >> s >> t;
            cout << minimum(s, t + 1, 0, size, 0) << endl;
        }else{
            int s, t;
            long x;
            cin >> s >> t >> x;
            change(s, t + 1, x, 0, size, 0);
        }
    }
}