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
    # Precompute modulo values
    P_mod = [x % MOD for x in P]
    Q = int(input[ptr])
    ptr += 1
    for _ in range(Q):
        A = int(input[ptr])
        B = int(input[ptr+1])
        K = int(input[ptr+2])
        ptr +=3
        # Convert to 0-based indices
        A -= 1
        B -= 1
        sub = P_mod[A:B+1]
        L = B - A + 1
        if K > L:
            print(0)
            continue
        dp = [0] * (K+1)
        dp[0] = 1
        for x in sub:
            # Iterate from K down to 1
            for k in range(min(K, len(dp)-1), 0, -1):
                dp[k] = (dp[k] + dp[k-1] * x) % MOD
        print(dp[K] % MOD)

if __name__ == "__main__":
    main()