#include <bits/stdc++.h>
#include "candies.h"
//#include "grader.cpp"
using namespace std;
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define fs first
#define sc second
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define dbg(x) cout << (#x) << " : " << (x) << endl;
typedef long long ll;
const int SZ=2e5+7;
int n,a[SZ],ans[SZ],mnC[SZ*4],mxC[SZ*4],mnD[SZ*4],mxD[SZ*4],lz[SZ*4];
void build(int i=1,int l=0,int r=n-1){
    lz[i]=0;
    if(l==r){
        mnC[i]=mxC[i]=0,mnD[i]=mxD[i]=a[l];
        return;
    }
    int md=(l+r)>>1;
    build(i*2,l,md),build(i*2+1,md+1,r);
    mnC[i]=min(mnC[i*2],mnC[i*2+1]);
    mnD[i]=min(mnD[i*2],mnD[i*2+1]);
    mxC[i]=max(mxC[i*2],mxC[i*2+1]);
    mxD[i]=max(mxD[i*2],mxD[i*2+1]);
}
void prp(int i){
    for(int ch=i*2;ch<=i*2+1;ch++){
        lz[ch]+=lz[i],
        mnC[ch]+=lz[i],mxC[ch]+=lz[i],
        mnD[ch]-=lz[i],mxD[ch]-=lz[i];
    }
    lz[i]=0;
}
void upd1(int l,int r,int v,int i=1,int lx=0,int rx=n-1){
    if(r<lx||rx<l||mxD[i]==0)return;
    if(lx>=l&&rx<=r&&(mnD[i]>=v||mnD[i]==mxD[i])){
        v=min(v,mnD[i]);
        lz[i]+=v,
        mnC[i]+=v,mxC[i]+=v,
        mnD[i]-=v,mxD[i]-=v;
        return;
    }
    int md=(lx+rx)>>1;
    prp(i);
    upd1(l,r,v,i*2,lx,md),upd1(l,r,v,i*2+1,md+1,rx);   
    mnC[i]=min(mnC[i*2],mnC[i*2+1]);
    mnD[i]=min(mnD[i*2],mnD[i*2+1]);
    mxC[i]=max(mxC[i*2],mxC[i*2+1]);
    mxD[i]=max(mxD[i*2],mxD[i*2+1]);
}
void upd2(int l,int r,int v,int i=1,int lx=0,int rx=n-1){
    if(r<lx||rx<l||mxC[i]==0)return;
    if(lx>=l&&rx<=r&&(mnC[i]>=v||mnC[i]==mxC[i])){
        v=min(v,mnC[i]);
        lz[i]-=v,
        mnC[i]-=v,mxC[i]-=v,
        mnD[i]+=v,mxD[i]+=v;
        return;
    }
    int md=(lx+rx)>>1;
    prp(i);
    upd2(l,r,v,i*2,lx,md),upd2(l,r,v,i*2+1,md+1,rx);   
    mnC[i]=min(mnC[i*2],mnC[i*2+1]);
    mnD[i]=min(mnD[i*2],mnD[i*2+1]);
    mxC[i]=max(mxC[i*2],mxC[i*2+1]);
    mxD[i]=max(mxD[i*2],mxD[i*2+1]);
}
void fi(int i=1,int l=0,int r=n-1){
    if(l==r){
        ans[l]=mnC[i];
        return;
    }
    prp(i);
    int md=(l+r)>>1;
    fi(i*2,l,md),fi(i*2+1,md+1,r);
}
vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v){
    n=sz(c);
    for(int i=0;i<n;i++)a[i]=c[i];
    build();
    int Q=sz(l);
    for(int q=0;q<Q;q++){
        if(v[q]>0)upd1(l[q],r[q],v[q]);
        else upd2(l[q],r[q],-v[q]);
    }
    fi();
    vector<int>s(n);
    for(int i=0;i<n;i++)s[i]=ans[i];
    return s;
}