///
/// "Excuse me... What did you say about my hair?!"
///
/// -Josuke Higashikata
#define _USE_MATH_DEFINES
#define FAST ios::sync_with_stdio(false),cin.tie(0);
#include <bits/stdc++.h>
#define Loop(x, l, r) for(int x = (l); x < (r); ++x)
#define LoopR(x, l, r) for(int x = (r)-1; x >= (l); --x)
#define all(x) x.begin(), x.end()
#define Kill(x) exit((cout << (x) << '\n', 0))
#define YN(flag) ((flag)? "YES": "NO")
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> pii;
typedef std::pair<ll ,ll > pll;
using namespace std;
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")
typedef vector<int> vec;
const int N = 200'010;
int a[N], c[N], l[N], r[N], v[N];
int n, q;
vec distribute_candies(vec cc, vec ll, vec rr, vec vv)
{
n = cc.size();
q = ll.size();
Loop(i,0,n) c[i] = cc[i];
Loop(i,0,q) l[i] = ll[i], r[i] = rr[i], v[i] = vv[i];
Loop(i,0,q)
{
int v = ::v[i], l = ::l[i], r = ::r[i];
if(v <= 0)
for(int j = l; j <= r; ++j)
a[j] = a[j]+v<0?0:a[j]+v;
else
for(int j = l; j <= r; ++j)
a[j] = a[j]+v>c[j]?c[j]:a[j]+v;
}
vec ans(n);
Loop(i,0,n) ans[i] = a[i];
return ans;
}
/*int main()
{
//auto ans = distribute_candies({10, 15, 13}, {0, 0}, {2, 1}, {20, -11});
//for(int x : ans) cout << x << ' ';
vec c(200000, 1e9);
vec l(200000, 0);
vec r(200000, 199999);
vec v(200000, 12);
distribute_candies(c,l,r,v);
}*/
