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<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,k,a,b,c,d,INF=((1LL<<31)-1);
vector<ll> node,lazy,v;
void ini(ll n){
    m=1;
    while(m<n)m*=2;
    node.resize(2*m-1,INF);
    lazy.resize(2*m-1,0);
    v.resize(2*m-1,0);
    return ;
}
void eval(ll k,ll l,ll r){
    if(v[k]!=0){
        node[k]=lazy[k];
        if(r-l>1){
            lazy[2*k+1]=lazy[k];
            lazy[2*k+2]=lazy[k];
            v[2*k+1]=1;
            v[2*k+2]=1;
        }
        lazy[k]=0;
        v[k]=0;
    }
    return ;
}
void add(ll a,ll b,ll x,ll k,ll l,ll r){
    eval(k,l,r);
    if(b<=l||r<=a)return ;
    if(a<=l&&r<=b){
        lazy[k]=x;
        v[k]=1;
        eval(k,l,r);
    }
    else{
        add(a,b,x,2*k+1,l,(l+r)/2);
        add(a,b,x,2*k+2,(l+r)/2,r);
        node[k]=min(node[2*k+1],node[2*k+2]);
    }
    return ;
}
ll getsum(ll a,ll b,ll k,ll l,ll r){
    if(b<=l||r<=a)return INF;
    eval(k,l,r);
    if(a<=l&&r<=b)return node[k];
    ll vl=getsum(a,b,2*k+1,l,(r+l)/2);
    ll vr=getsum(a,b,2*k+2,(l+r)/2,r);
    return min(vr,vl);
}
int main(void){
    cin>>n>>k;
    ini(n);
    for(int i=0;i<k;i++){
        cin>>a;
        if(a==0){
            cin>>a>>b>>c;
            add(a,b+1,c,0,0,m);
        }
        else{
            cin>>a>>b;
            cout<<getsum(a,b+1,0,0,m)<<endl;
        }
        //for(auto x:node)cout<<x<<" ";
        //cout<<endl;
    }
}