mod = 998244353
n = int(input())
p = list(map(int,input().split()))
f = [[0] * (n+1) for i in range(n+1)]
f[0][0] = 1
for i in range(n):
	for j in range(n+1):
		f[i+1][j] += f[i][j]
		if j >= 1: f[i+1][j] += f[i][j-1] * p[i]
		f[i+1][j] %= mod


g = [[0] * (n+1) for i in range(n+1)]
g[0][0] = 1
for i in range(n):
	for j in range(n+1):
		g[i+1][j] = g[i][j]
	for j in range(1, n+1):
		g[i+1][j] += g[i+1][j-1] * (-p[i])
		g[i+1][j] %= mod		

q = int(input())
for i in range(q):
	a, b, k = map(int,input().split())
	a -= 1
	ans = 0
	for j in range(k+1):
		ans += f[b][j] * g[a][k-j]
		ans %= mod
	print(ans)