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

using namespace std;

typedef int ll;

vector<ll> distribute_candies(vector<ll> c, vector<ll> l, vector<ll> r, vector<ll> v) {
	ll n = c.size(), q = v.size();
	vector<pair<ll, ll>> all;
	for (ll i = 0; i < n; i++) {
		all.emplace_back(c[i], i);
	}
	sort(all.begin(), all.end());
	ll ps = 0;
	for (ll i = 0; i < q; i++) {
		ps += v[i];
		if (ps < 0) {
			ps = 0;
		}
	}
	ll now = q, ns = 0;
	vector<ll> ans(n);
	for (ll i = 0; i < n; i++) {
		while (now > 0 && abs(ns) < all[i].first) {
			now--;
			ns += v[now];
		}
		if (abs(ns) >= all[i].first) {
			ans[all[i].second] = (ns < 0 ? 0 : all[i].first);
		} else {
			ans[all[i].second] = ps;
		}
	}
	return ans;
}