#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#define fi first
#define se second

using namespace std;
using LL = long long;
using LLL = __int128;
const int MAXN = 2e5+5;

int n, m;
vector<pair<int, int>> op[MAXN];

namespace SGT {
    struct Node {
        LL mx, mn, tag;
        Node(LL a=0, LL b=0) {
            mx = a, mn = b, tag = 0;
        }
        Node operator+(Node x) {
            return Node(max(mx, x.mx), min(mn, x.mn));
        }
        void modify(LL v) {
            mx += v, mn += v, tag += v;
        }
    } s[MAXN<<2];

    void spread(int cur) {
        if (!s[cur].tag) return;
        s[cur<<1].modify(s[cur].tag), s[cur<<1|1].modify(s[cur].tag);
        s[cur].tag = 0;
    }

    void update(int cur, int l, int r, int L, int R, LL v) {
        if (L <= l && R >= r) return s[cur].modify(v);
        spread(cur);
        int mid = (l + r) >> 1;
        if (L <= mid) update(cur<<1, l, mid, L, R, v);
        if (R > mid) update(cur<<1|1, mid+1, r, L, R, v);
        s[cur] = s[cur<<1] + s[cur<<1|1];
    }

    int queryBin(int cur, int l, int r, int c, Node& res) {
        if (l == r) return res = res + s[cur], l;
        spread(cur);
        int mid = (l + r) >> 1;
        Node rv = s[cur<<1|1] + res;
        if (rv.mx - rv.mn > c) return queryBin(cur<<1|1, mid+1, r, c, res);
        else return res = rv, queryBin(cur<<1, l, mid, c, res);
    }

    LL queryPos(int cur, int l, int r, int p) {
        if (l == r) return s[cur].mx;
        spread(cur);
        int mid = (l + r) >> 1;
        if (p <= mid) return queryPos(cur<<1, l, mid, p);
        else return queryPos(cur<<1|1, mid+1, r, p);
    }
}

vector<int> distribute_candies(vector<int> c, 
    vector<int> ql, vector<int> qr, vector<int> qv) {
    vector<int> ans;
    n = c.size(), m = ql.size();
    for (int i = 0; i < m; ++i) {
        op[ql[i]].push_back(make_pair(i, qv[i]));
        op[qr[i]+1].push_back(make_pair(i, -qv[i]));
    }
    for (int i = 0; i < n; ++i) {
        for (auto x:op[i]) SGT::update(1, 0, m, x.fi+1, m, x.se);
        SGT::Node res(-2e9, 2e9);
        int p = SGT::queryBin(1, 0, m, c[i], res);
        LL ed = SGT::queryPos(1, 0, m, m);
        int cur = 0;
        if (res.mx - res.mn <= c[i]) cur = ed - min(0ll, res.mn);
        else if (res.mx == SGT::queryPos(1, 0, m, p)) cur = ed - res.mn;
        else cur = ed - res.mx + c[i];
        ans.push_back(cur);
    }
    return ans;
}