MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    P = list(map(int, input[ptr:ptr+N]))
    ptr += N
    Q = int(input[ptr])
    ptr += 1
    queries = []
    for _ in range(Q):
        A = int(input[ptr])
        B = int(input[ptr+1])
        K = int(input[ptr+2])
        queries.append((A-1, B-1, K))  # Convert to 0-based indices
        ptr +=3
    
    # Precompute modulo for P
    P_mod = [x % MOD for x in P]
    
    for A, B, K in queries:
        L = B - A + 1
        if K > L:
            print(0)
            continue
        dp = [0] * (K + 1)
        dp[0] = 1
        for i in range(A, B + 1):
            x = P_mod[i]
            # Iterate from current_max down to 1
            current_max = min(K, i - A + 1)
            for k in range(current_max, 0, -1):
                dp[k] = (dp[k] + dp[k-1] * x) % MOD
        print(dp[K] % MOD)

if __name__ == "__main__":
    main()