#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <wall.h>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define ll int64_t
#define ld long double
#define nl cout<<"\n"
#define i128 __int128_t
#define all(v) v.begin(),v.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define forn(i,a,b) for(int64_t i=int64_t(a);i<int64_t(b);++i)
#define forb(i,a,b) for(int64_t i=int64_t(a);i>=int64_t(b);--i)
#define fastio() ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mod 1'000'000'007
#define mod2 998'244'353
#define inf 1'000'000'000'000'007
#define pi 3.14159265358979323846
template<class key,class cmp=std::less<key>>
using ordered_set=tree<key,null_type,cmp,rb_tree_tag,tree_order_statistics_node_update>;
template<class L,class R> ostream& operator<<(ostream& out,pair<L,R> &p) {return out<<"("<<p.ff<<", "<<p.ss<<")";}
template<class T> ostream& operator<<(ostream& out,vector<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,deque<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,set<T> &s) {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class T> ostream& operator<<(ostream& out,ordered_set<T> &s) {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class L,class R> ostream& operator<<(ostream& out,map<L,R> &m) {out<<"{";for(auto it=m.begin();it!=m.end();++it){if(it!=m.begin())out<<", ";out<<*it;}return out<<"}";}
void dbg_out() {cerr<<"]\n";}
template<typename Head,typename... Tail>
void dbg_out(Head H,Tail... T) {cerr<<H;if(sizeof...(Tail))cerr<<", ";dbg_out(T...);}
#ifdef LOCAL
#define dbg(...) cerr<<"["<<#__VA_ARGS__<<"] = [",dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
//---------------------------------mars4---------------------------------
class Segtree
{
ll N;
vector<ll> segtree;
vector<ll> minval;
vector<ll> maxval;
void _set_maxval(ll i)
{
if(maxval[i]<minval[i])
{
maxval[i]=minval[i];
}
}
void _set_minval(ll i)
{
if(minval[i]>maxval[i])
{
minval[i]=maxval[i];
}
}
void _setval(ll i,ll val)
{
if(val>0)
{
minval[i]=max(minval[i],val);
_set_maxval(i);
}
else
{
maxval[i]=min(maxval[i],-val);
_set_minval(i);
}
}
void _push_maxval(ll st,ll ed,ll val,ll i)
{
if(st^ed)
{
maxval[i<<1]=min(maxval[i<<1],val);
_set_minval(i<<1);
maxval[i<<1|1]=min(maxval[i<<1|1],val);
_set_minval(i<<1|1);
}
}
void _push_minval(ll st,ll ed,ll val,ll i)
{
if(st^ed)
{
minval[i<<1]=max(minval[i<<1],val);
_set_maxval(i<<1);
minval[i<<1|1]=max(minval[i<<1|1],val);
_set_maxval(i<<1|1);
}
}
void _update(ll st,ll ed,ll l,ll h,ll val,ll i=1)
{
if(maxval[i]!=inf)
{
segtree[i]=min(segtree[i],maxval[i]);
_push_maxval(st,ed,maxval[i],i);
maxval[i]=inf;
}
if(minval[i])
{
segtree[i]=max(segtree[i],minval[i]);
_push_minval(st,ed,minval[i],i);
minval[i]=0;
}
if(st>ed or st>h or ed<l)
return;
if(st>=l and ed<=h)
{
_setval(i,val);
if(maxval[i]!=inf)
{
segtree[i]=min(segtree[i],maxval[i]);
_push_maxval(st,ed,maxval[i],i);
maxval[i]=inf;
}
if(minval[i])
{
segtree[i]=max(segtree[i],minval[i]);
_push_minval(st,ed,minval[i],i);
minval[i]=0;
}
return;
}
ll mid=(st+ed)>>1;
_update(st,mid,l,h,val,i<<1);
_update(mid+1,ed,l,h,val,i<<1|1);
}
ll _query(ll st,ll ed,ll l,ll r,ll i=1)
{
if(maxval[i]!=inf)
{
segtree[i]=min(segtree[i],maxval[i]);
_push_maxval(st,ed,maxval[i],i);
maxval[i]=inf;
}
if(minval[i])
{
segtree[i]=max(segtree[i],minval[i]);
_push_minval(st,ed,minval[i],i);
minval[i]=0;
}
if(st>ed or st>r or ed<l)
return 0;
if(st>=l and ed<=r)
return segtree[i];
ll mid=(st+ed)>>1;
return _query(st,mid,l,r,i<<1)+_query(mid+1,ed,l,r,i<<1|1);
}
public:
void init(ll n)
{
N=n;
segtree=vector<ll>(N<<2);
minval=vector<ll>(N<<2);
maxval=vector<ll>(N<<2,inf);
}
void update(ll l,ll r,ll val)
{
_update(0,N-1,l,r,val);
}
ll query(ll l,ll r)
{
return _query(0,N-1,l,r);
}
};
void buildWall(int n,int k,int op[],int left[],int right[],int height[],int finalHeight[])
{
Segtree s;
s.init(n);
forn(i,0,k)
{
if(op[i]==1)
{
s.update(left[i],right[i],height[i]);
}
else
{
s.update(left[i],right[i],-height[i]);
}
}
forn(i,0,n)
{
finalHeight[i]=s.query(i,i);
}
}
