from bisect import *
MOD=998244353
N,Q=map(int, input().split())
A=list(map(int, input().split()))
A.sort()
dp=[[0]*(N+1) for _ in range(N)]
dp[N-1][0]=A[N-1]-1
dp[N-1][1]=1
for r in range(N-1)[::-1]:
    for k in range(N-r+1):
        dp[r][k]=dp[r+1][k]*(A[r]-1)+dp[r+1][k-1]
        dp[r][k]%=MOD
dp2=[1]*(N+1)
for l in range(N):
    dp2[l]=A[l]*dp2[l-1]
    dp2[l]%=MOD
for _ in range(Q):
    l,r,p=map(int, input().split())
    res=0
    for i in range(l,r+1):
        j=bisect_left(A,i)
        res^=dp2[j-1]*dp[j][p]%MOD
    print(res%MOD)