import sys

readline = sys.stdin.readline

ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))


def solve():
    mod = 998244353
    n, q = nm()
    a = nl() + [-1]
    b = [tuple(nm()) for _ in range(q)]
    a.sort(reverse=True)
    acc = [1]*(n+1)
    for i in range(n-1, -1, -1):
        acc[i] = acc[i+1] * a[i] % mod
    dp = [[0]*(n+2) for i in range(n+1)]
    dp[0][0] = 1
    for i in range(n):
        for j in range(n+1):
            if dp[i][j]:
                dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j]) % mod
                dp[i+1][j] = (dp[i+1][j] + (a[i] - 1) * dp[i][j]) % mod

    for l, r, p in b:
        idx = 0
        res = 0
        for i in range(r, l-1, -1):
            while a[idx] >= i:
                idx += 1
            res ^= dp[idx][p] * acc[idx] % mod
        print(res % mod)
    return

solve()