#include "candies.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=200007;

vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v)
{
	int n=sz(c),q=sz(l);
	vector<int>ans(n);
	FOR(i,0,n-1)
	{
		vector<ll>V={0};
		FOR(j,0,q-1) if(i>=l[j]&&i<=r[j]) V.pb(V.back()+(ll)v[j]);
		reverse(all(V));
		ll mn=infl,mx=-infl;
		ans[i]=-1;
		for(auto x:V)
		{
			mn=min(mn,x);
			mx=max(mx,x);
			if(mx-mn>c[i])
			{
				if(x==mn) ans[i]=V[0]-(mx-(ll)c[i]);
				else ans[i]=V[0]-mn;
				break;
			}
		}
		if(ans[i]==-1) ans[i]=V[0]-mn;
	}
	return ans;
}