//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
#include "candies.h"
struct segbeb1 {
    vector<array<int, 3>> ar;
    segbeb1(int n, int tpp = 0) {
        ar.clear();
        ar.push_back({n, 0, tpp});
    }
    vector<array<int, 3>> compress(vector<array<int, 3>> art) {
        vector<array<int, 3>> ar2;
        for (auto i : art) {
            if (!ar2.empty() and ar2.back()[2] == 1 and ar2.back()[1] + ar2.back()[0] == i[1] and i[2] == 1) {
                ar2.back()[0] += i[0];
            } else  if (!ar2.empty() and ar2.back()[2] == 0 and ar2.back()[1] == i[1] and i[2] == 0) {
                ar2.back()[0] += i[0];
            } else {
                ar2.push_back(i);
            }
        }
        return ar2;
    }
    void addx(int x) {
        vector<array<int, 3>> ar2;
        int lv = 0;
        for (auto &[cnt, lfvl, add] : ar) {
            lfvl += x;
            if (x > 0) {
                if (lv < lfvl) {
                    if (add == 1) {
                        lfvl = lv;
                        ar2.push_back({cnt, lfvl, add});
                    } else {
                        array<int, 3> lf, rg;
                        lf = {min(cnt, lfvl - lv), lv, 1};
                        ar2.push_back(lf);
                        if (cnt > lf[0]) {
                            rg = {cnt - lf[0], lfvl, 0};
                            ar2.push_back(rg);
                        }
                    }
                } else {
                    ar2.push_back({cnt, lfvl, add});
                }
            } else {
                if (lfvl < 0) {
                    if (add == 0) {
                        lfvl = 0;
                        ar2.push_back({cnt, lfvl, add});
                    } else {
                        array<int, 3> lf, rg;
                        lf = {min(cnt, -lfvl), 0, 0};
                        ar2.push_back(lf);
                        if (cnt > lf[0]) {
                            rg = {cnt - lf[0], 0, 1};
                            ar2.push_back(rg);
                        }
                    }
                } else {
                    ar2.push_back({cnt, lfvl, add});
                }
            }
            lv += cnt;
        }
        ar = compress(ar2);
        //for (auto i : ar)
        //    cout << i[0] << ' ' << i[1] << ' ' << i[2] << endl;
        //cout << endl;
    }
    int getv(int v) {
        int l = 0;
        for (auto i : ar) {
            if (l + i[0] > v) {
                return i[1] + (v - l) * i[2];
            }
            l += i[0];
        }
        exit(1);
    }
};
struct segbeb2 {
    vector<array<int, 3>> ar;
    int N;
    segbeb2() {
    }
    segbeb2(int n) {
        N = n;
        ar.clear();
        ar.push_back({n + 1, 0, 1});
    }
    vector<array<int, 3>> compress(vector<array<int, 3>> art) {
        vector<array<int, 3>> ar2;
        for (auto i : art) {
            if (!ar2.empty() and ar2.back()[2] == 1 and ar2.back()[1] + ar2.back()[0] == i[1] and i[2] == 1) {
                ar2.back()[0] += i[0];
            } else  if (!ar2.empty() and ar2.back()[2] == 0 and ar2.back()[1] == i[1] and i[2] == 0) {
                ar2.back()[0] += i[0];
            } else {
                ar2.push_back(i);
            }
        }
        return ar2;
    }
    void addx(int x) {
        vector<array<int, 3>> ar2;
        int lv = 0;
        for (auto &[cnt, lfvl, add] : ar) {
            lfvl += x;
            if (x > 0) {
                if (lfvl + cnt * add > N) {
                    if (add == 0) {
                        lfvl = N;
                        ar2.push_back({cnt, lfvl, add});
                    } else {
                        array<int, 3> lf, rg;
                        rg = {min(cnt, lfvl+cnt-N), N, 0};
                        if (cnt > rg[0]) {
                            lf = {cnt - rg[0], N - (cnt-rg[0]), 1};
                            ar2.push_back(lf);
                        }
                        ar2.push_back(rg);
                    }
                } else {
                    ar2.push_back({cnt, lfvl, add});
                }
            } else {
                if (lfvl < 0) {
                    if (add == 0) {
                        lfvl = 0;
                        ar2.push_back({cnt, lfvl, add});
                    } else {
                        array<int, 3> lf, rg;
                        lf = {min(cnt, -lfvl), 0, 0};
                        ar2.push_back(lf);
                        if (cnt > lf[0]) {
                            rg = {cnt - lf[0], 0, 1};
                            ar2.push_back(rg);
                        }
                    }
                } else {
                    ar2.push_back({cnt, lfvl, add});
                }
            }
            lv += cnt;
        }
        ar = compress(ar2);
        //for (auto i : ar)
        //    cout << i[0] << ' ' << i[1] << ' ' << i[2] << endl;
        //cout << endl;
    }
    int getv(int v) {
        int l = 0;
        for (auto i : ar) {
            if (l + i[0] > v) {
                return i[1] + (v - l) * i[2];
            }
            l += i[0];
        }
        while (1);
    }
};
vector<int> solveallon(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    segbeb1 beba(1e9 + 5);
    for (auto i : v) {
        beba.addx(i);
    }
    vector<int> res(c.size());
    for (int i = 0; i < c.size(); ++i) {
        res[i] = beba.getv(c[i]);
    }
    return res;
}
struct sqrtpart {
    segbeb2 beba;
    bool pus = 1;
    int CC;
    vector<int> vals;
    sqrtpart(int n, int c) {
        beba = segbeb2(c);
        vals.assign(n, 0);
        CC = c;
    };
    void trypush() {
        if (pus)
            return;
        pus = 1;
        for (auto &i : vals) {
            i = beba.getv(i);
        }
        beba = segbeb2(CC);
    }
    void givelr(int l, int r, int x) {
        trypush();
        for (int i = l; i < r; ++i) {
            vals[i] += x;
            vals[i] = min(vals[i], CC);
            vals[i] = max(vals[i], 0);
        }
    }
    void giveall(int x) {
        beba.addx(x);
        pus = 0;
    }
    vector<int> getel() {
        trypush();
        return vals;
    }
};
int K = 400;
int nxt(int v) {
    return (v+(K-1))/K*K;
}
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    int be = 1;
    for (int i = 0; i < l.size(); ++i) {
        if (l[i] != 0 or r[i] != n- 1)
            be = 0;
    }
    if (be)
        return solveallon(c,l,r,v);
    vector<sqrtpart> a((n+(K-1)) / K, {K, c[0]});
    for (int i = 0; i < v.size(); ++i) {
        int lv = l[i], rg = r[i] + 1;
        if (lv % K != 0 and nxt(lv) <= rg) {
            a[lv / K].givelr(lv % K, K, v[i]);
            lv = nxt(lv);
        }
        while (lv + K <= rg) {
            a[lv / K].giveall(v[i]);
            lv += K;
        }
        if (lv != rg)
            a[lv / K].givelr(lv % K, rg % K, v[i]);
    }
    vector<int> res;
    for (auto &i : a) {
        for (auto j : i.getel())
            res.push_back(j);
    }
    while (res.size() > n)
        res.pop_back();
    return res;
    /**/
}
#ifdef __APPLE__

int main() {
    int n;
    assert(1 == scanf("%d", &n));
    std::vector<int> c(n);
    for(int i = 0; i < n; ++i) {
        assert(scanf("%d", &c[i]) == 1);
    }

    int q;
    assert(1 == scanf("%d", &q));
    std::vector<int> l(q), r(q), v(q);
    for(int i = 0; i < q; ++i) {
        assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);
    }

    std::vector<int> ans = distribute_candies(c, l, r, v);

    for(int i = 0; i < (int)ans.size(); ++i) {
        if (i > 0) {
            printf(" ");
        }
        printf("%d", ans[i]);
    }
    printf("\n");
    fclose(stdout);
    return 0;
}
#endif
/*
5
5 5 5 5 5
3
2 4 1
1 5 2
3 3 3
 */