#include<iostream>
#include<cstdio>
#include<cmath>
#define N 100000
#define M 1000000
#define S 262144
#define K 20
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,m,sz,length,rev[S+1],a[N+1],b[N+1],block[N+1],sl[M+1],sr[M+1],sL[M+1],A[S+1],B[S+1],C[S+1],num[S+1],wn[K+1][S+1],wn2[K+1][S+1];
void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=0;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		s1=fast_pow(limit,mod-2);
		for (int i=0;i<=limit;++i) s[i]=1ll*s[i]*s1%mod;
	}
	return;
}
void adder(int l,int r,int d)
{
	for (int i=l;i+7<=r;i+=8)
	{
		b[i+d]+=a[i];
		b[i+1+d]+=a[i+1];
		b[i+2+d]+=a[i+2];
		b[i+3+d]+=a[i+3];
		b[i+4+d]+=a[i+4];
		b[i+5+d]+=a[i+5];
		b[i+6+d]+=a[i+6];
		b[i+7+d]+=a[i+7];
	}
	for (int i=1;i<=((r-l+1)&7);++i) b[r-i+1+d]+=a[r-i+1];
	return;
}
int main()
{
	int limit=1,l,r,L,w;
	bool op;
	for (int i=2;i<=S;i<<=1)
	{
		num[i]=++length,w=fast_pow(g,(mod-1)/i);
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn[num[i]][j]=res;
		w=fast_pow(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn2[num[i]][j]=res;
	}
	n=read();
	for (int i=1;i<=n;++i) a[i]=read();
	m=read(),sz=3125;
	while (limit<=sz+n) limit<<=1;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?limit>>1:0);
	for (int i=1;i<=n;++i) block[i]=(i-1)/sz+1;
	for (int i=1;i<=m;++i)
	{
		l=sl[i]=read(),r=sr[i]=read(),L=sL[i]=read(),r=sr[i]=min(r,n-L+l);
		if (block[r]-block[l]<=1) adder(l,r,L-l);
		else adder(l,min(block[l]*sz,n),L-l),adder((block[r]-1)*sz+1,r,L-l);
	}
	for (int i=1;i<=block[n];++i)
	{
		op=0;
		for (int j=0;j<=limit;++j) A[j]=B[j]=0;
		for (int j=(i-1)*sz+1;j<=min(i*sz,n);++j) A[j-(i-1)*sz]=a[j];
		for (int j=1;j<=m;++j)
		{
			l=sl[j],r=sr[j],L=sL[j];
			if (block[l]+1<=i&&i<=block[r]-1) B[(i-1)*sz-l+L]++,op=1;
		}
		if (!op) continue;
		NTT(limit,A,1),NTT(limit,B,1);
		for (int j=0;j<=limit;++j) Adder(C[j],1ll*A[j]*B[j]%mod);
	}
	NTT(limit,C,-1);
	for (int i=1;i<=n;++i) b[i]+=C[i];
	for (int i=1;i<=n;++i) printf("%d\n",b[i]);
	puts("");
	return 0;
}