mod = 998244353

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    ptr = 0
    N = int(data[ptr])
    ptr += 1
    P = list(map(int, data[ptr:ptr+N]))
    ptr += N
    
    # Preprocess P to mod 998244353
    for i in range(N):
        P[i] %= mod
        if P[i] < 0:
            P[i] += mod
    
    # Precompute prefix sums for K=1 queries
    sum_prefix = [0] * (N + 1)
    for i in range(N):
        sum_prefix[i+1] = (sum_prefix[i] + P[i]) % mod
    
    Q = int(data[ptr])
    ptr += 1
    results = []
    for _ in range(Q):
        A = int(data[ptr])
        B = int(data[ptr+1])
        K = int(data[ptr+2])
        ptr += 3
        
        L = B - A + 1
        if K > L:
            results.append(0)
            continue
        
        if K == 1:
            res = (sum_prefix[B] - sum_prefix[A-1]) % mod
            results.append(res)
            continue
        
        # Initialize DP array
        max_k = K
        dp = [0] * (max_k + 1)
        dp[0] = 1
        
        for idx in range(A-1, B):
            p = P[idx]
            current_max_k = min(max_k, idx - (A-1) + 1)
            for k in range(current_max_k, 0, -1):
                dp[k] = (dp[k] + dp[k-1] * p) % mod
        
        results.append(dp[K] % mod)
    
    print('\n'.join(map(str, results)))

if __name__ == "__main__":
    main()