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 <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
  
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
  
const int MAX_N=1<<17;
const ll INF=(1ll<<31)-1;
   
ll mn[2*MAX_N-1], part[2*MAX_N-1];
int m;
  
void init(int n){
    m=1;
    while(m<n) m*=2;
    for(int i=0; i<2*m-1; i++){
        mn[i]=INF;
        part[i]=INF;
    }
}
 
void eval(int k, int l, int r){
    if(part[k]<INF){
        mn[k]=part[k];
        if(k<m-1){
            part[2*k+1]=part[k];
            part[2*k+2]=part[k];
          	mn[2*k+1]=part[2*k+1];
          	mn[2*k+2]=part[2*k+2];
        }
        part[k]=INF;
    }
}
   
void update(int a, int b, ll x, int k, int l, int r){
    if(r<=a || b<=l) return;
  	eval(k, l, r);
    if(a<=l && r<=b){
        part[k]=x;
        eval(k, l, r);
    }else{
        update(a, b, x, k*2+1, l, (l+r)/2);
        update(a, b, x, k*2+2, (l+r)/2, r);
        mn[k]=min(mn[2*k+1], mn[2*k+2]);
    }
}
   
ll find(int a, int b, int k, int l, int r){
    if(b<=l || r<=a){
        return INF;
    }
    eval(k, l, r);
    if(a<=l && r<=b){
        return mn[k];
    }else{
        return min(find(a, b, 2*k+1, l, (l+r)/2), find(a, b, 2*k+2, (l+r)/2, r));
    }
}
  
int main()
{
    int n, q;
    cin>>n>>q;
    init(n);
    for(int i=0; i<q; i++){
        int tp;
        cin>>tp;
        if(tp==0){
            int s, t; ll x;
            cin>>s>>t>>x;
            update(s, t+1, x, 0, 0, m);
        }else{
            int s, t;
            cin>>s>>t;
            cout<<find(s, t+1, 0, 0, m)<<endl;
        }
    }
    return 0;
}