import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
mod = 998244353
nn = 10**5
fact = [1] * nn
for i in range(nn - 1):
    fact[i + 1] = fact[i] * (i + 1) % mod
invfact = [1] * nn
invfact[nn - 1] = pow(fact[nn - 1], mod - 2, mod)
for i in range(nn - 1)[::-1]:
    invfact[i] = invfact[i + 1] * (i + 1) % mod
 
def binom(x, y):
    if x < 0 or y < 0 or x - y < 0:
        return 0
    return fact[x] * invfact[y] % mod * invfact[x - y] % mod

n = ni()
a = na()

mod = 998244353
dp = [[0 for j in range(n+1)]for i in range(n+1)]
dp[0][0] = 1

for i in range(n):
    for j in range(n):
        if dp[i][j] == 0:
            continue
        dp[i+1][j] += dp[i][j]
        dp[i+1][j] %= mod
        if j + 1 <= n:
            dp[i+1][j+1] += dp[i][j] * a[i] % mod
            dp[i+1][j+1] %= mod

dp2 = [[0 for j in range(n+1)]for i in range(n+1)]
dp2[0][0] = 1
for i in range(1, n+1):
    for j in range(n+1):
        if j:
            dp2[i][j] = (dp2[i-1][j] + dp2[i][j-1] * (-a[i-1])%mod)%mod
        else:
            dp2[i][j] = dp2[i-1][j]

q = ni()
for _ in range(q):
    a,b,k = na()
    a -= 1
    ans = 0
    #print(dp[b])
    #print(dp2[a])
    for i in range(k+1):
        ans += dp[b][i] * dp2[a][k-i] % mod
        ans %= mod
    print(ans)