#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define dte tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;
int st[(int)5e6 + 10];
int lazy[(int)5e6 + 10];
int mx[(int)5e6 + 10];
int mn[(int)5e6 + 10];
void update(int pos , int l , int r , int i , int j , int t, int w){
if(lazy[pos] != -1){
mn[pos] = mx[pos] = st[pos] = lazy[pos];
if(l != r) {
lazy[2 * pos + 1] = lazy[pos];
lazy[2 * pos + 2] = lazy[pos];
}
lazy[pos] = -1;
}
if(i > r || j < l) return ;
if( (t == 1 && mn[pos] >= w) || (t == 2 && mx[pos] <= w) ) return ;
if(i <= l && j >= r && ((t == 1 && mx[pos] < w) || (t == 2 && mn[pos] > w) ) ) {
st[pos] = mn[pos] = mx[pos] = w;
if(l != r){
lazy[2 * pos + 1] = w;
lazy[2 * pos + 2] = w;
}
return ;
}
update(2 * pos + 1 , l , (l+r) / 2 , i , j , t , w); update(2 * pos + 2 , (l+r) / 2 + 1 , r , i , j , t , w);
mn[pos] = min(mn[2 * pos + 1] , mn[2 * pos + 2]); mx[pos] = max(mx[2 * pos + 1] , mx[2 * pos + 2]);
}
int rq(int pos , int l , int r , int i ){
if(lazy[pos] != -1){
if(l == r) st[pos] = lazy[pos];
if(l != r) {
lazy[2 * pos + 1] = lazy[pos];
lazy[2 * pos + 2] = lazy[pos];
}
lazy[pos] = -1;
}
if(i > r || i < l) return -1;
if(l == r) return st[pos];
int p1 = rq(2 * pos + 1 , l , (l+r) / 2 , i) , p2 = rq(2 * pos + 2 , (l+r)/ 2 + 1 , r, i);
if(p1 == -1) return p2;
return p1;
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
memset(lazy , -1 , sizeof lazy);
for(int i = 0 ; i < k ; i++) update(0 , 0 , n - 1 , left[i] , right[i] , op[i] , height[i]);
for(int i = 0 ; i < n ; i++) finalHeight[i] = rq(0 , 0 , n - 1 , i);
//for(int i = 0 ; i < n ; i++) cout << finalHeight[i] << " "; cout << "\n";
return ;
}
int op[101];
int l[101];
int r[101];
int height[101];
int v[101];
/*int main(){
//ifstream fin ("testing.txt");
//ofstream fout ("output.txt");
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n , k; cin>>n>>k;
for(int i = 0 ; i < k ; i++) cin>>op[i]>>l[i]>>r[i]>>height[i];
buildWall(n , k , op , l , r , height , v);
//for(auto c : v) cout << c << " "; cout << "\n";
return 0;
}*/
/*
10 6
1 1 8 4
2 4 9 1
2 3 6 5
1 0 5 3
1 2 2 5
2 6 7 0
*/
/*
Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
Read the statement CAREFULLY !!
Make a GREADY APPROACH !!!! (start from highest / lowest)
Make your own TESTS !!
Be careful from CORNER CASES !
*/
