#include<bits/stdc++.h>
using namespace std;
const int N=5005,M=998244353;
int n,q,p[N],a,b,k;
int f[N][N],g[N][N];
signed main(){
	cin>>n;
	g[0][0]=f[0][0]=1;
	for(int i=1;i<=n;i++){
		cin>>p[i],p[i]=(p[i]%M+M)%M;
		g[i][0]=1,f[i][0]=1;
		for(int j=n;j;j--)g[i][j]=(g[i-1][j]+1ll*g[i-1][j-1]*p[i])%M;
		for(int j=1;j<=n;j++)f[i][j]=(f[i-1][j]-1ll*f[i][j-1]*p[i])%M,f[i][j]=(f[i][j]+M)%M;
	}
	cin>>q;
	while(q--){
		cin>>a>>b>>k;
		int ans=0;
		for(int i=0;i<=k;i++)ans=(ans+1ll*g[b][i]*f[a-1][k-i])%M;
		cout<<ans<<'\n';
	}
	return 0;
}