import numpy as np
import bisect

N, Q = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
MOD = 998244353

dp = np.zeros((N + 1, N + 2), dtype=np.int64)
dp[0, 1] = 1
for i, a in enumerate(A):
    dp[i + 1][1:] = dp[i][1:] * (a - 1) + dp[i][:-1]
    dp[i + 1] %= MOD

t = 1
for i, a in enumerate(reversed(A)):
    t = (t * a) % MOD
    dp[N - 1 - i] *= t
    dp[N - 1 - i] %= MOD

Am = [-a for a in A]
for _ in range(Q):
    l, r, p = map(int, input().split())
    ans = 0
    for i in range(l, r + 1):
        y = bisect.bisect_right(Am, -i)
        ans ^= dp[y, p + 1]
    print(ans % MOD)