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;
/*
  RMQ and RUQ
  区間の最小値を得る(RMQ)
  区間の値を変更する(RUQ)
 */

template<typename dtype>
class RMQ{
public : 
  dtype initValue; //範囲外の時に返す値
  
  struct data{
    bool type; //0 - empty   , 1 - update
    dtype value;
  };
  
  int n,n_;
  vector<dtype> dat;
  vector<data> td;
  int toMax;          //0 -> RangeMin 1->RangeMax;
  
  RMQ(){n=-1;}
  RMQ(int n_, dtype initValue, int toMax = 0):n_(n_),initValue(initValue),toMax(toMax){
    n=1;
    while(n<n_)n*=2;
    td.resize(2*n-1,(data){0,initValue});
    dat.resize(2*n-1,initValue);
  }

  inline dtype merge(dtype a, dtype b){return toMax? max(a, b):min(a, b);}
  
  
  dtype dfs(int a,int b,dtype x,bool flag,int k,int l,int r){
    if(r <= a || b <= l) return flag? dat[k]:initValue;
    if(a <= l && r <= b){
      if(flag == true){
        td[k]=(data){1,x};
        dat[k]=x;
      }
      return dat[k];
    }
    
    if(td[k].type){
      td[k].type = 0;
      dat[k*2+1] = dat[k*2+2] = td[k].value;
      td[k*2+1] = td[k*2+2] = (data){1,td[k].value};
    }

    dtype vl=dfs(a, b, x, flag, k*2+1, l, (l+r)/2);
    dtype vr=dfs(a, b, x, flag, k*2+2, (l+r)/2, r);
    return flag? (dat[k] = merge(vl, vr)):min(vl,vr);
  }
  
  //[l,r)の値をxに変更　update(l,r,x)
  void update(int l,int r,dtype x){
    assert(l <= r), assert(l <= n && r <= n), assert(l >= 0 && r >= 0);
    dfs(l, r, x, true, 0, 0, n);
  }
  
  //[l,r)の最小値を得る　find(l,r);
  dtype get(int l,int r){
    assert(l <= r), assert(l <= n && r <= n), assert(l >= 0 && r >= 0);
    return dfs(l, r, initValue , false, 0 , 0 ,n);
  }
};


int main(){
  int q,n;
  cin>>n>>q;
  typedef long long ll;
  RMQ <ll> T(n, INT_MAX);
  
  while(q--){
    int cmd,s,t,x;
    scanf("%d%d%d",&cmd,&s,&t);
    if(cmd==0)cin>>x,T.update(s,t+1,x);
    else cout <<T.get(s,t+1)<<endl;
  }
  return 0;
}