import bisect
from itertools import count

n,q = map(int,input().split())
A = list(map(int,input().split()))
Q = [list(map(int,input().split())) for i in range(q)]
A.sort()
mod = 998244353

dp = [[0]*(n+1) for i in range(n+1)]
dp[n][0] = 1
for i in range(n)[::-1]:
    a = A[i]
    for j in range(n+1):
        if dp[i+1][j] == 0:
            continue
        dp[i][j] += dp[i+1][j]*(a-1)%mod
        dp[i][j] %= mod
        dp[i][j+1] += dp[i+1][j]
        dp[i][j+1] %= mod

cumA = [1]
for a in A:
    cumA.append(cumA[-1]*a%mod)

for l,r,p in Q:
    ans = 0
    for i in range(l,r+1):
        ind = bisect.bisect_left(A,i)
        count = cumA[ind]*dp[ind][p]%mod
        ans ^= count
    print(ans%mod)