#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 998244353;
ll dp[6001][6001];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, Q;
	cin >> N >> Q;

	int A[6000];
	rep(i, N) cin >> A[i];
	sort(A, A + N);
	reverse(A, A + N);

	dp[0][0] = 1;
	rep(i, N) {
		for (int j = i + 1; j >= 0; j--) {
			dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod;
			dp[i + 1][j] = dp[i][j] * (A[i] - 1) % mod;
		}
	}

	rep(i, Q) {
		int l, r, p;
		cin >> l >> r >> p;

		ll kotae = 0;
		ll are = 1;
		ll tmp = 0;
		int mae = l - 1;
		for (int j = N - 1; j >= 0; j--) {
			if (A[j] <= l) are = are * A[j] % mod;
			else {
				tmp = dp[j + 1][p] * are % mod;
				for (int k = j; k >= 0; k--) {

					if (A[k] > r) break;
					else {
						if ((A[k] - mae) % 2) {
							kotae ^= tmp;
						}
						mae = A[k];

						while (k > 0 && A[k - 1] == A[k]) are = are * A[k] % mod, k--;
						are = are * A[k] % mod;
					}
					tmp = dp[k][p] * are % mod;
				}
				if ((r - mae) % 2) {
					kotae ^= tmp;
				}

				break;
			}
		}

		co(kotae);
	}



	Would you please return 0;
}