#include "candies.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 2e18;
const ll mod2 = 1e9+7;
const ll base=67;
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9;
int kk;
int t;
int el = 19;/*
main()
{
if(fopen(task2".inp","r"))
{
fin(task2);
fou(task2);
}
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
// cin>>s1;
//int t;cin>>t; while(t--)
phongbeo(),down
checktime
}*/
ll cost[200007],dist[200007];
struct ib
{
ll a,b;
};
struct ic
{
ll a,b,c;
} dd;
vector<ib> v[200007];
set<ll> in,ou;
vector<int> ans;
struct segtree
{
ic t[800032];
ic mer(ic a,ic b)
{
ic c;
c.a=a.a+b.a;
c.b=min(a.b,b.b+a.a);
c.c=max(a.c,b.c+a.a);
return c;
}
void flip(int node,int l,int r,int l1,int x)
{
if(l==r)
{
if(x==1)
{
t[node]= {cost[l],min(0ll,cost[l]),max(0ll,cost[l])};
}
else
{
t[node]= {0,inf,-inf};
}
return;
}
int mid=l+r>>1;
if(l1<+mid)flip(node<<1,l,mid,l1,x);
else flip(node<<1|1,mid+1,r,l1,x);
t[node]=mer(t[node<<1],t[node<<1|1]);
}
int walk(int node,int l,int r,ic x,int z)
{
if(l==r) return l;
int mid=l+r>>1;
ic xx=mer(t[node<<1|1],x);
if(xx.c-xx.b<z) return walk(node<<1,l,mid,xx,z);
return walk(node<<1|1,mid+1,r,x,z);
}
ic get(int node,int l,int r,int l1,int r1)
{
if(l>r1||r<l1) return dd;
if(l>=l1&&r<=r1) return t[node];
int mid=l+r>>1;
return mer(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
}
} st;
vector<int> distribute_candies(vector<int> C,vector<int> L,vector<int> R,vector<int> V)
{
n=C.size();
m=L.size();
for(int i=0; i<n; i++)
dist[i]=C[i];
for(int i=0; i<m; i++)
v[L[i]].pb({1,i}),
v[R[i]+1].pb({-1,i});
for(int i=0; i<m; i++)
cost[i+1]=V[i];
for(int i=1; i<=4*m+4; i++)
st.t[i]= {0,inf,-inf};
s4=0;
for(int i=0; i<n; i++)
{
for(auto x:v[i])
st.flip(1,0,m,x.b,x.a),s4+=x.a;
if(s4==0)
{
ans.pb(0);
continue;
}
if(st.t[1].c-st.t[1].b<=dist[i])ans.pb(st.t[1].a-st.t[1].b);
else
{
int x=st.walk(1,0,m,dd,dist[i]);
ic ddd=st.get(1,0,m,x,m);
if(ddd.b==min(cost[x],0ll) &&ddd.c!=0)ans.pb(max(0ll,dist[i]-(ddd.c-ddd.a)));
else ans.pb(ddd.a-ddd.b);
}
}
return ans;
}/**
vector<int> trau(vector<int> C,vector<int> L,vector<int> R,vector<int> V)
{
n=C.size();
m=L.size();
for(int i=0; i<C.size(); i++)
dist[i]=C[i],cost[i]=0;
for(int i=0; i<m; i++)
{
for(int j=L[i]; j<=R[i]; j++)
{
cost[j]+=V[i];
if(cost[j]<0)cost[j]=0;
if(cost[j]>dist[j])cost[j]=dist[j];
}
}
ans.clear();
for(int i=0; i<n; i++)
ans.pb(cost[i]);
return ans;
}
///https://codeforces.com/blog/entry/92083?#comment-807860
void phongbeo()
{
cin>>n>>m;
vector<int> C;
for(int i=1; i<=n; i++)
cin>>s2,C.pb(s2);
vector<int> L,R,V;
for(int i=1; i<=m; i++)
cin>>l>>r>>s2,L.pb(l),R.pb(r),V.pb(s2);
vector<int> vv=distribute_candies(C,L,R,V);
vector<int>kiki=trau(C,L,R,V);
if(vv!=kiki)
{
for(auto x:vv)
cout<<x<<" ";
down
for(auto x:kiki)
cout<<x<<" ";
}
}
*/
