#include "candies.h"

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define double long double
#define f first
#define s second
#define pb push_back
#define pp push
#define ceil(x,y) (x/y)+(x%y!=0)*(x*y<0?0:1)
#define floor(x,y) (x/y)+(x%y!=0)*(x*y<0?-1:0)
const int MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;
vector<in> distribute_candies(vector<in> c, vector<in> l, vector<in> r, vector<in> v) {
    int n = c.size(),q=l.size();
    vector<in> ans(n);
    for(int i=0;i<q;i++){
    	for(int j=l[i];j<=r[i];j++){
    		if(v[i]>0)
    			ans[j]=min(ans[j]+v[i],c[j]);
    		else
    			ans[j]=max(0,ans[j]-v[i]);
    	}
    }
    return ans;
}