#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
#define i128 __int128
using namespace std;
const int N = 1e6 + 7, mod = 1e9 + 7;

int n;
struct tag {
	ll inc;
	ll l, r;
	tag() {
		inc = 0;
		l = 0;
		r = mod;
	}
	ll calc(ll w) {
		return min(max(w + inc, l), r);
	}
};
tag operator + (tag l, tag r) {
	tag o;
	o.inc = l.inc + r.inc;
	o.l = r.calc(l.l);
	o.r = r.calc(l.r);
	return o;
}
vi distribute_candies(vi c, vi l, vi r, vi v) {
	n = sz(c);
	reverse(l.begin(), l.end());
	reverse(r.begin(), r.end());
	reverse(v.begin(), v.end());
	vi ns(n);
	L(p, 0, sz(c) - 1) {
		int x = 0;
		int mn = 0, mx = 0;
		int ans = -1;
		L(i, 0, sz(l) - 1) {
			if(l[i] <= p && p <= r[i]) {
				x += v[i];
				mn = min(mn, x);
				mx = max(mx, x);
				if(mx - mn >= c[p]) {
					ans = v[i] > 0 ? c[p] + mn : mx;
					break;
				}
			}
		}
		if(ans == -1) {
			x += v[p];
			mx = max(mx, x);
			ans = mx - mn >= c[p] ? mn + c[p] : mx;
		}
		ns[p] = ans;
	}
	return ns;
}

// int main() {
//     auto P = distribute_candies(vi{10, 15, 13}, vi{0, 0}, vi{2, 1}, vi{20, -11});
// 	for(auto&u : P) cout << u << endl;
// 	return 0;
// }