#include<bits/stdc++.h>
using namespace std;
//#define local
#ifndef local
#include "candies.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n, q;
int cap[N];

ii answer[N];

vector<iii> ques;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    bool ck = 1;
    n = c.size(), q = l.size();
    for(int i = 0; i < n; i++){
        //cap[i] = c[i];
        answer[i] = {0, c[i]};
    }
    for(int i = 0; i < q; i++){
        //ques.pb({{l[i], r[i]}, v[i]});
        if(v[i] > 0){
            for(int j = l[i]; j <= r[i]; j++){
                answer[i].fi = min(answer[i].se, answer[i].fi + v[i]);
            }
        }
        else{
            for(int j = l[i]; j <= r[i]; j++){
                answer[i].fi = max(0, answer[i].fi + v[i]);
            }
        }
    }
    vector<int> vv;
    for(int i = 0; i < n; i++) vv.pb(answer[i].fi);
    return vv;
    //return s;
}