#include<bits/stdc++.h>
#include "candies.h"
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int query,node;
bool M2;
vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) {
node=sz(c);
query=sz(l);
vector<long long>ans(node,0),pre(query+1),maxx(query+5,0),minn(query+5,0);
vector<ii>x;
for(int i=1;i<=query;++i)pre[i]=pre[i-1]+v[i-1];
maxx[query]=minn[query]=pre[query];
for(int i=query-1;i>=0;--i){
maxx[i]=max(maxx[i+1],pre[i]);
minn[i]=min(minn[i+1],pre[i]);
// cout <<pre[i]<<'\n';
}
for(int i=0;i<node;++i){
if(maxx[0]-minn[0]<c[i]){
ans[i]=pre[query]-minn[0];
// cout <<maxx[0]<<" "<<minn[0]<<'\n';
continue;
}
int l=0,r=query,pos=0;
while(l<=r){
int mid=(r+l)>>1;
if(maxx[mid]&&maxx[mid]-minn[mid]>=c[i]){
pos=mid;
l=mid+1;
}
else r=mid-1;
}
if(minn[pos]==pre[pos])
ans[i]=c[i]-(maxx[pos]-pre[query]);
else ans[i]=pre[query]-minn[pos];
}
return ans;
}
// main()
// {
// srand(time(0));
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// #define task "aws"
// if(fopen(task".inp","r")){
// freopen(task".inp","r",stdin);
// freopen(task".out","w",stdout);
// }
// int t=1;
// // cin >> t;
// int node,query;
// cin >> node;
// vector<int>c(node);
// for(auto &x:c)cin >> x;
// cin>> query;
// vector<int>l(query),r(query),v(query);
// for(int i=0;i<=query;++i){
// int q,w,val;
// cin >> q >> w >> val;
// l[i]=q;
// r[i]=w;
// v[i]=val;
// }
// vector<int>x=distribute_candies(c,l,r,v);
// for(auto y:x)cout <<y<<" ";
// }
