#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 2e5;
vector<int> seg(maxN << 4), lazy(maxN << 4);
int cmp, n;

void push(int v)
{
    seg[v * 2] += lazy[v];
    seg[v * 2] = min(cmp, max(-0, seg[v * 2]));
    seg[v * 2 + 1] += lazy[v];
    seg[v * 2 + 1] = min(cmp, max(-0, seg[v * 2 + 1]));
    lazy[v * 2] += lazy[v];
    lazy[v * 2] = min(cmp, max(-cmp, lazy[v * 2]));
    lazy[v * 2 + 1] += lazy[v];
    lazy[v * 2 + 1] = min(cmp, max(-cmp, lazy[v * 2 + 1]));
    lazy[v] = 0;
}

void update(int l, int r, int val, int tl = 0, int tr = n - 1, int v = 1)
{
    if (l > r)
    {
        return;
    }
    if (l == tl and r == tr)
    {
        seg[v] += val;
        seg[v] = min(cmp, max(-0, seg[v]));
        lazy[v] += val;
        lazy[v] = min(cmp, max(-cmp, lazy[v]));
    }
    else
    {
        push(v);
        int mid = tl + (tr - tl) / 2;
        update(l, min(mid, r), val, tl, mid, v * 2);
        update(max(mid + 1, l), r, val, mid + 1, tr, v * 2 + 1);
        seg[v] = seg[v * 2] + seg[v * 2 + 1];
        seg[v] = min(cmp, max(-0, seg[v]));
    }
}

int query(int idx, int tl = 0, int tr = n - 1, int v = 1)
{
    if (tl == tr)
    {
        return seg[v];
    }
    else
    {
        push(v);
        int mid = tl + (tr - tl) / 2;
        if (idx <= mid)
        {
            return query(idx, tl, mid, v * 2);
        }
        else
        {
            return query(idx, mid + 1, tr, v * 2 + 1);
        }
    }
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    n = c.size();
    cmp = c.front();
    vector<int> res(n);
    for (int i = 0; i < l.size(); i++)
    {
        update(l[i], r[i], v[i]);
        // for (int j = 0; j < n; j++)
        // {
        //     res[j] = query(j);
        //     cout << res[j] << ' ';
        // }
        // cout << '\n';
    }

    for(int i = 0; i < n; i++)
    {
        res[i] = query(i);
    }

    return res;
}