#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	int n; cin >> n;
	vector<mint> p(n);
	for (int i=0; i<n; i++){
		int x; cin >> x;
		p[i] = x;
	}

	vector<vector<mint>> f(n+1, vector<mint>(n+1));
	vector<vector<mint>> g(n+1, vector<mint>(n+1));
	f[0][0] = 1;
	g[0][0] = 1;
	for (int i=0; i<n; i++){
		for (int j=0; j<n+1; j++){
			f[i+1][j] += f[i][j];
		}
		for (int j=1; j<n+1; j++){
			f[i+1][j] += f[i][j-1] * p[i];
		}
	}
	for (int i=0; i<n; i++){
		for (int j=0; j<n+1; j++){
			g[i+1][j] = g[i][j];
		}
		for (int j=1; j<n+1; j++){
			g[i+1][j] += g[i+1][j-1] * (-p[i]);
		}
	}
	int q; cin >> q;
	for (int i=0; i<q; i++){
		int a, b, k; cin >> a >> b >> k;
		a--;
		mint ans = 0;
		for (int j=0; j<k+1; j++){
			ans += f[b][j] * g[a][k-j];
		}
		cout << ans.val() << "\n";
	}
	
}