#include<bits/stdc++.h>
#define ll long long
using namespace std;
constexpr ll maxn=5e3+5,modd=998244353;
ll mul[maxn][maxn],inv[maxn][maxn*3],n,q,p[maxn];
ll qpow(ll a,ll b){
	ll ret=1;
	while(b){
		if(b&1)ret=(ret*a)%modd;
		a=(a*a)%modd;
		b>>=1;
	}
	return ret;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>p[i];
	mul[1][0]=inv[1][n]=inv[0][n]=1;
	mul[1][1]=p[1];
	for(int i=n+1;i<=3*n;i++)inv[1][i]=(inv[1][i-1]*(-p[1]))%modd;
	for(int i=2;i<=n;i++){
		mul[i][0]=1;
		ll invp=qpow(p[i],modd-2);
		for(int j=1;j<=n;j++)mul[i][j]=(mul[i-1][j]+mul[i-1][j-1]*p[i])%modd;
		for(int j=3*n;j>=0;j--)inv[i][j]=(inv[i-1][j]*invp+inv[i][j+1]*(-invp))%modd;
		for(int j=0;j<=3*n;j++)inv[i][j]=inv[i][j+1];
	}
	cin>>q;
	while(q--){
		ll l,r,k,ans=0;
		cin>>l>>r>>k;
		for(int i=-n+k;i<=k;i++)ans=(ans+mul[r][k-i]*inv[l-1][i+n])%modd;
		cout<<(ans%modd+modd)%modd<<"\n";
	}
	return 0;
}