#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, q;
vector <int> event[N];
long long sum[4 * N], Max[4 * N], Min[4 * N];
void upd(int u, int val, int s = 1, int l = 0, int r = q - 1){
if (l == r){
sum[s] = val;
Max[s] = max(0, val);
Min[s] = min(0, val);
return;
}
int mid = l + r >> 1;
if (mid >= u) upd(u, val, 2 * s, l, mid);
else upd(u, val, 2 * s + 1, mid + 1, r);
sum[s] = sum[2 * s] + sum[2 * s + 1];
Max[s] = max(Max[2 * s], sum[2 * s] + Max[2 * s + 1]);
Min[s] = min(Min[2 * s], sum[2 * s] + Min[2 * s + 1]);
}
long long get(int time, int s = 1, int l = 0, int r = q - 1){
if (l == r){
if (sum[s] < 0) return 0;
if (sum[s] > time) return time;
return sum[s];
}
int mid = l + r >> 1;
if (Max[2 * s + 1] - Min[2 * s + 1] > time) return get(time, 2 * s + 1, mid + 1, r);
long long rt = get(time, 2 * s, l, mid);
if (rt + Max[2 * s + 1] > time) return time - (Max[2 * s + 1] - sum[2 * s + 1]);
if (rt + Min[2 * s + 1] < 0) return sum[2 * s + 1] - Min[2 * s + 1];
return rt + sum[2 * s + 1];
}
vector <int> distribute_candies(vector <int> c, vector <int> l, vector <int> r, vector <int> v){
n = c.size(), q = l.size();
for (int i = 0; i < q; ++ i){
event[l[i]].push_back(i + 1);
event[r[i] + 1].push_back(-i - 1);
}
vector <int> ans;
for (int i = 0; i < n; ++ i){
for (int id : event[i]){
if (id < 0) upd(-id - 1, 0);
else upd(id - 1, v[id - 1]);
}
ans.push_back(get(c[i]));
}
return ans;
}
