#include <stdio.h>

const int Mod = 998244353;

void merge_sort(int x[], int n)
{
	static int y[6003] = {};
	if (n <= 1) return;
	merge_sort(&(x[0]), n/2);
	merge_sort(&(x[n/2]), (n+1)/2);
	
	int i, p, q;
	for (i = 0, p = 0, q = n/2; i < n; i++) {
		if (p >= n/2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int main()
{
	int i, N, Q, A[6003];
	scanf("%d %d", &N, &Q);
	for (i = 1, A[0] = 0, A[N+1] = 1 << 30; i <= N; i++) scanf("%d", &(A[i]));
	merge_sort(A, N + 2);

	int j, k, l, m[2], r, p, q;
	long long ans, tmp, coeff[6001][6001];
	for (i = N - 1, coeff[N][0] = A[N] - 1, coeff[N][1] = 1; i >= 1; i--) {
		for (j = 0, coeff[i][0] = 0; j <= N - i; j++) {
			coeff[i][j+1] = coeff[i+1][j];
			coeff[i][j] = (coeff[i][j] + coeff[i+1][j] * (A[i] - 1)) % Mod;
		}
	}
	for (q = 1; q <= Q; q++) {
		scanf("%d %d %d", &l, &r, &p);
		for (j = 1; A[j] < l; j++);
		for (k = j; A[k] < r; k++);
		
		ans = 0;
		for (i = 1, tmp = 1; i < j; i++) tmp = tmp * A[i] % Mod;
		for (; j <= k && N - j + 1 >= p; tmp = tmp * A[j++] % Mod) {
			m[0] = (l > A[j-1] + 1)? l: A[j-1] + 1;
			m[1] = (r < A[j])? r: A[j];
			if ((m[1] - m[0]) % 2 == 1) continue;
			ans ^= tmp * coeff[j][p] % Mod;
		}
		printf("%lld\n", ans % Mod);
	}
	
	fflush(stdout);
	return 0;
}