#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define eps 1e-9
#define mod 998244353

using namespace std;
typedef pair<llint, llint> P;

llint n, Q;
llint a[6005];
llint l[6005], r[6005], p[6005];
llint dp[2][6005];
llint b[6005], nb[6005];
vector<P> vec;
llint ans[5005];

void calc(llint a)
{
	for(int i = 0; i <= n; i++) nb[i] = 0;
	for(int i = n; i >= 1; i--){
		nb[i-1] = b[i];
		b[i-1] += mod - (a-1)*b[i]%mod, b[i-1] %= mod;
	}
	for(int i = 0; i <= n; i++) nb[i] *= a, nb[i] %= mod;
	for(int i = 0; i <= n; i++) b[i] = nb[i];
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> Q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a+1, a+n+1);
	
	for(int i = 1; i <= Q; i++){
		cin >> l[i] >> r[i] >> p[i];
		for(int j = l[i]; j <= r[i]; j++) vec.push_back(P(j, i));
	}
	sort(vec.begin(), vec.end());
	
	dp[0][0] = 1;
	for(int i = 0; i < n; i++){
		for(int j = 0; j <= n; j++) dp[(i+1)%2][j] = 0;
		for(int j = 0; j <= n; j++){
			dp[(i+1)%2][j] += dp[i%2][j] * (a[i+1]-1) % mod, dp[(i+1)%2][j] %= mod;
			if(j+1 <= n) dp[(i+1)%2][j+1] += dp[i%2][j], dp[(i+1)%2][j+1] %= mod;
		}
	}
	for(int i = 0; i <= n; i++) b[i] = dp[n%2][i];
	
	llint pos = 1;
	for(int i = 0; i < vec.size(); i++){
		while(pos <= n && a[pos] < vec[i].first){
			calc(a[pos]);
			pos++;
		}
		llint id = vec[i].second;
		ans[id] ^= b[p[id]];
	}
	
	for(int i = 1; i <= Q; i++) cout << ans[i]%mod << endl;
	
	return 0;
}