import sys
input = sys.stdin.readline
from bisect import *

N, Q = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
dp = [[0]*(N+1) for _ in range(N+1)]
dp[0][0] = 1
MOD = 998244353

for i in range(N):
    for j in range(N+1):
        dp[i+1][j] += dp[i][j]*(A[N-1-i]-1)
        dp[i+1][j] %= MOD
        
        if j+1<=N:
            dp[i+1][j+1] += dp[i][j]
            dp[i+1][j+1] %= MOD

acc = [1]

for Ai in A:
    acc.append(acc[-1]*Ai%MOD)
    
for _ in range(Q):
    l, r, p = map(int, input().split())
    ans = 0
    
    for i in range(l, r+1):
        c = bisect_left(A, i)
        ans ^= dp[N-c][p]*acc[c]%MOD
    
    print(ans)