# coding: utf-8 # Your code here! import sys readline = sys.stdin.readline read = sys.stdin.read n,q = map(int,readline().split()) *a, = map(int,readline().split()) M = map(int,read().split()) x = [0]*(n+1) x[0] = 1 MOD = 998244353 def mul(x,v): for j in range(n,0,-1): x[j] *= v x[j] = (x[j]+x[j-1])%MOD x[0] = x[0]*v%MOD def div(x,v): if v==0: for j in range(n): x[j] = x[j+1] x[-1] = 0 return for j in range(1,n+1): x[j] += x[j-1]*v x[j] %= MOD for ai in a: mul(x,ai-1) Q = [list(map(int,i)) for i in zip(M,M,M)] #print(Q) res = [0]*q a.sort() R = [] for i in a: if not R or R[-1]!=x: R.append(x[:]) c = pow(i-1,MOD-2,MOD) cc = 1 div(x,-c) cc = (cc*i*c)%MOD if i!=1: for i in range(n+1): x[i] = x[i]*cc%MOD R.append(x) #print(R) #print(a) a = sorted(set(a)) for l,r,p in Q: res = 0 v = 0 for i,ai in enumerate(a): if l <= ai <= r: if (ai - max(v,l-1))&1: res ^= R[i][p] v = ai #print(res) print(res) #print(24^36^48,26^21^12,9^3,1)