mod = 998244353

n = int(input())
P = list(map(int, input().split()))
for i in range(n):
    P[i] %= mod  # Preprocess to mod
Q = int(input())
queries = [tuple(map(int, input().split())) for _ in range(Q)]

for A, B, K in queries:
    start = A - 1
    end = B
    dp = [0] * (K + 1)
    dp[0] = 1
    current_length = 0
    for i in range(start, end):
        current_length += 1
        num = P[i]
        max_k = min(K, current_length)
        for k in range(max_k, 0, -1):
            dp[k] = (dp[k] + dp[k-1] * num) % mod
    print(dp[K] % mod)