mod = 998244353

n = int(input())
p = list(map(int, input().split()))
# Precompute modulo to handle negative values
p = [x % mod for x in p]
q = int(input())
for _ in range(q):
    a, b, k = map(int, input().split())
    a -= 1  # Convert to 0-based index
    b -= 1
    sub = p[a:b+1]
    dp = [0] * (k + 1)
    dp[0] = 1
    for num in sub:
        # Iterate backwards to prevent overwriting values we need
        for i in range(min(k, len(dp) - 1), 0, -1):
            dp[i] = (dp[i] + dp[i-1] * num) % mod
    print(dp[k] % mod)