// Problem: P8527 [Ynoi2003] 樋口円香
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P8527
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define uint unsigned
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

namespace IO {
	const int maxn = 1 << 20;
	
    char ibuf[maxn], *iS, *iT, obuf[maxn], *oS = obuf;

	inline char gc() {
		return (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, maxn, stdin), (iS == iT ? EOF : *iS++) : *iS++);
	}

	template<typename T = int>
	inline T read() {
		char c = gc();
		T x = 0;
		bool f = 0;
		while (c < '0' || c > '9') {
			f |= (c == '-');
			c = gc();
		}
		while (c >= '0' && c <= '9') {
			x = (x << 1) + (x << 3) + (c ^ 48);
			c = gc();
		}
		return f ? ~(x - 1) : x;
	}

	inline void flush() {
		fwrite(obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	
	struct Flusher {
		~Flusher() {
			flush();
		}
	} AutoFlush;

	inline void pc(char ch) {
		if (oS == obuf + maxn) {
			flush();
		}
		*oS++ = ch;
	}

	template<typename T>
	inline void write(T x) {
		static char stk[64], *tp = stk;
		if (x < 0) {
			x = ~(x - 1);
			pc('-');
		}
		do {
			*tp++ = x % 10;
			x /= 10;
		} while (x);
		while (tp != stk) {
			pc((*--tp) | 48);
		}
	}
	
	template<typename T>
	inline void writesp(T x) {
		write(x);
		pc(' ');
	}
	
	template<typename T>
	inline void writeln(T x) {
		write(x);
		pc('\n');
	}
}

using IO::read;
using IO::write;
using IO::pc;
using IO::writesp;
using IO::writeln;

const int maxn = 100100;
const int B = 1500;
const int maxm = 1000100;
const int mod = 1004535809, G = 3;

inline int qpow(int b, int p) {
	int res = 1;
	while (p) {
		if (p & 1) {
			res = 1LL * res * b % mod;
		}
		b = 1LL * b * b % mod;
		p >>= 1;
	}
	return res;
}

int n, m, a[maxn], b[maxn], r[maxm];
struct node {
	int l, r, k;
} c[maxm];

typedef vector<int> poly;

inline void NTT(vector<int> &a, int op) {
	int n = (int)a.size();
	for (int i = 0; i < n; ++i) {
		if (i < r[i]) {
			swap(a[i], a[r[i]]);
		}
	}
	for (int k = 1; k < n; k <<= 1) {
		int wn = qpow(op == 1 ? G : qpow(G, mod - 2), (mod - 1) / (k << 1));
		poly pw(k);
		pw[0] = 1;
		for (int i = 1; i < k; ++i) {
			pw[i] = 1LL * pw[i - 1] * wn % mod;
		}
		for (int i = 0; i < n; i += (k << 1)) {
			for (int j = 0; j < k; ++j) {
				int x = a[i + j], y = 1LL * a[i + j + k] * pw[j] % mod;
				a[i + j] = (x + y < mod ? x + y : x + y - mod);
				a[i + j + k] = (x < y ? x - y + mod : x - y);
			}
		}
	}
	if (op == -1) {
		int inv = qpow(n, mod - 2);
		for (int i = 0; i < n; ++i) {
			a[i] = 1LL * a[i] * inv % mod;
		}
	}
}

inline poly operator * (poly a, poly b) {
	NTT(a, 1);
	NTT(b, 1);
	int n = (int)a.size();
	for (int i = 0; i < n; ++i) {
		a[i] = 1LL * a[i] * b[i] % mod;
	}
	NTT(a, -1);
	return a;
}

inline poly mul(const poly &a, const poly &b) {
	int n = (int)a.size() - 1, m = (int)b.size() - 1, k = 0;
	while ((1 << k) <= n + m) {
		++k;
	}
	for (int i = 1; i < (1 << k); ++i) {
		r[i] = (r[i >> 1] >> 1) | ((i & 1) << (k - 1));
	}
	poly A(1 << k), B(1 << k);
	for (int i = 0; i <= n; ++i) {
		A[i] = a[i];
	}
	for (int i = 0; i <= m; ++i) {
		B[i] = b[i];
	}
	poly res = A * B;
	res.resize(n + m + 1);
	return res;
}

void solve() {
	n = read();
	for (int i = 1; i <= n; ++i) {
		a[i] = read();
	}
	m = read();
	for (int i = 1; i <= m; ++i) {
		c[i].l = read();
		c[i].r = read();
		c[i].k = read();
		int l = c[i].l, r = c[i].r, k = c[i].k;
		int bl = (l + B - 1) / B, br = (r + B - 1) / B;
		if (bl == br) {
			for (int i = l; i <= r; ++i) {
				b[k + i - l] += a[i];
			}
		} else {
			for (int i = l; i <= B * bl; ++i) {
				b[k + i - l] += a[i];
			}
			for (int i = B * (br - 1) + 1; i <= r; ++i) {
				b[k + i - l] += a[i];
			}
		}
		c[i].k -= c[i].l;
		c[i].l = bl;
		c[i].r = br;
	}
	for (int k = 1; k <= (n + B - 1) / B; ++k) {
		int l = (k - 1) * B + 1, r = min(k * B, n);
		poly A(r - l + 1), B(n - r + l);
		for (int i = l; i <= r; ++i) {
			A[i - l] = a[i];
		}
		for (int i = 1; i <= m; ++i) {
			if (c[i].l < k && k < c[i].r) {
				int p = c[i].k + l;
				++B[p - 1];
			}
		}
		poly C = mul(A, B);
		for (int i = 1; i <= n; ++i) {
			b[i] += C[i - 1];
		}
	}
	for (int i = 1; i <= n; ++i) {
		printf("%d\n", b[i]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}