//#include<bits/stdc++.h>
//using namespace std;
//#define local
#ifndef local
//#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,bmi,sse,sse2")
#include "candies.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

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

const ll N = 3e5 + 5;

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

mt19937 rng(1);

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

ll n, q;
ll 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();
    int mini = 1;
    for(ll i = 0; i < v.size(); i++) mini = min(mini, v[i]);
    if(n <= 2000 && q <= 2000){
        for(ll i = 0; i < n; i++){
            //cap[i] = c[i];
            answer[i] = {0, c[i]};
        }
        for(ll i = 0; i < q; i++){
            //ques.pb({{l[i], r[i]}, v[i]});
            //cout << l[i] << " " << r[i] << " " << v[i] << "\n";
            if(v[i] > 0){
                for(ll j = l[i]; j <= r[i]; j++){
                    answer[j].fi = min(answer[j].se, answer[j].fi + v[i]);
                }
            }
            else{
                for(ll j = l[i]; j <= r[i]; j++){
                    answer[j].fi = max(0LL, answer[j].fi + v[i]);
                }
            }
            //for(ll i = 0; i < n; i++) cout << answer[i].fi << " ";
            //cout << "\n";
        }
    }
    else if(mini > 0){
        for(ll i = 0; i < q; i++){
            answer[l[i]].fi += v[i];
            answer[r[i] + 1].fi -= v[i];
           // cout << l[i] << "  " << r[i] << " " << v[i] << "\n";
        }
        for(ll i = 1; i < n; i++){
            answer[i].fi += answer[i - 1].fi;
            //cout << answer[i].fi << "\n";
        }
        for(ll i = 0; i < n; i++) answer[i].fi = min(answer[i].fi, (ll)c[i]);
    }
    else{

    }
    vector<int> vv;
    for(ll i = 0; i < n; i++) vv.pb(answer[i].fi);
    //cout << (double)clock() / (double)CLOCKS_PER_SEC << "\n";
    return vv;
    //return s;
}