import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

from bisect import bisect_left

n, q = LI()
aa = LI()
aa.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]

def add(i, j, val):
    dp[i][j] = (dp[i][j]+val)%md

dp[0][0] = 1
for i, a in enumerate(aa):
    for j in range(i+1):
        pre = dp[i][j]
        add(i+1, j, pre*(a-1))
        add(i+1, j+1, pre)
# p2D(dp)

aa.reverse()
cm = [1]
for a in aa:
    cm.append(cm[-1]*a%md)

for _ in range(q):
    l, r, p = LI()
    ans = 0
    for k in range(l, r+1):
        i = bisect_left(aa, k)
        cur = dp[n-i][p]*cm[i]%md
        # print(k,i,p,cur)
        ans ^= cur
    print(ans)