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 INF = INT_MAX;


struct lst
{
private:
    int n;
    vector<int> node;
    vector<int> lazy;
    vector<int> lflg;
    void lazy2node(int k, int l, int r)
    {
        if(lflg[k])
        {
            node[k]=lazy[k];
            lflg[k]=false;
            prop(k, l, r);
        }
    }
    void prop(int k, int l, int r)
    {
        if(r-l>0)
        {
            lazy[2*k+1]=lazy[2*k+2]=node[k];
            lflg[2*k+1]=lflg[2*k+2]=true;
        }
    }
public:
    lst(int sz)
    {
        n=1; while (n<sz) n*=2;
        node.resize(2*n-1, INF);
        lazy.resize(2*n-1, 0);
        lflg.resize(2*n-1, false);
    }

    void update(int qa, int qb, int v, int k=0, int l=0, int r=-1)
    {
        if(r<0) r=n-1;
        lazy2node(k, l, r);
        if(qb<l || r<qa) return;
        if(qa<=l && r<=qb)
        {
            node[k]=v;
            prop(k,l,r);
        }
        else
        {
            int m = (l+r)/2;
            update(qa, qb, v, 2*k+1, l, m);
            update(qa, qb, v, 2*k+2, m+1, r);
            node[k]=min(node[2*k+1],node[2*k+2]);
        }
    }

    int get(int qa, int qb, int k=0, int l=0, int r=-1)
    {
        if(r<0) r=n-1;
        if(qb<l || qa>r) return INF;
        lazy2node(k,l,r);
        if(qa<=l && r<=qb) return node[k];
        else
        {  
            int m = (l+r)/2;
            int la = get(qa, qb, 2*k+1, l, m);
            int lb = get(qa, qb, 2*k+2, m+1, r);
            return min(la, lb);
        } 
    }
};


int main()
{
    int n, q;
    scanf("%d %d", &n, &q);

    lst tree = lst(n);
    for(int i=0;i<q; i++)
    {
        int type;
        scanf("%d", &type);
        if(!type)
        {
            int s, t, x;
            scanf("%d %d %d", &s, &t, &x);
            tree.update(s, t, x);
        }
        else
        {
            int s, t;
            scanf("%d %d", &s, &t);
            printf("%lld\n", tree.get(s,t));
        }
        
    }
}