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<vector>
#include<algorithm>
using namespace std;

const int INF = (1 << 31) - 1;

struct segtree{
  int size;
  vector<int> dat,lazy;
  segtree(int n){
    size = 1;
    while(size<n) size *= 2;
    dat.assign(2*size-1,INF);
    lazy.assign(2*size-1,-1);
  }
  void lazy_evaluate(int k){
    if(lazy[k]<0) return;
    dat[k] = lazy[k];
    if(k<size-1){
      lazy[2*k+1] = lazy[k];
      lazy[2*k+2] = lazy[k];
    }
    lazy[k] = -1;
  }
  void update(int a,int b,int x,int k,int l,int r){
    lazy_evaluate(k);
    if(b<=l||r<=a) return;
    if(a<=l&&r<=b){
      lazy[k] = x;
      lazy_evaluate(k);
      return;
    }
    update(a,b,x,2*k+1,l,(l+r)/2);
    update(a,b,x,2*k+2,(l+r)/2,r);
    dat[k] = min(dat[2*k+1],dat[2*k+2]);
    return;
  }
  int query(int a,int b,int k,int l,int r){
    lazy_evaluate(k);
    if(b<=l||r<=a) return INF;
    else if(a<=l&&r<=b) return dat[k];
    else return min(query(a,b,2*k+1,l,(l+r)/2),query(a,b,2*k+2,(l+r)/2,r));
  }
};

int main(){
  int n,q;
  scanf("%d %d",&n,&q);
  segtree st(n);
  for(int i=0;i<q;i++){
    int cmd;
    scanf("%d",&cmd);
    if(cmd==0){
      int s,t,x;
      scanf("%d %d %d",&s,&t,&x);
      st.update(s,t+1,x,0,0,st.size);
    }else{
      int s,t;
      scanf("%d %d",&s,&t);
      printf("%d\n",st.query(s,t+1,0,0,st.size));
    }
  }
  return 0;
}