#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
int64_t rs64() {
	int64_t n;
	scanf("%" SCNd64, &n);
	return n;
}

#define MOD 998244353
int main() {
	int n = ri(), q = ri();
	int a[n];
	for (auto &i : a) i = ri();
	
	int mult[n + 1];
	mult[0] = 1;
	for (int i = 0; i < n; i++) mult[i + 1] = (int64_t) mult[i] * a[i] % MOD;
	
	std::vector<int> poly[n + 1];
	poly[n] = { 1 };
	for (int i = n; i--; ) {
		poly[i] = poly[i + 1];
		poly[i].insert(poly[i].begin(), 0);
		for (int j = 1; j < (int) poly[i].size(); j++) poly[i][j - 1] = (poly[i][j - 1] + (int64_t) poly[i][j] * (a[i] - 1)) % MOD;
	}
	
	std::pair<int, int> ranges[n + 1];
	for (int i = 0; i < n; i++) ranges[i].second = ranges[i + 1].first = a[i] + 1;
	ranges[0].first = 1;
	ranges[n].second = 1000000001;
	
	for (int i = 0; i < q; i++) {
		int l = ri();
		int r = ri() + 1;
		int p = ri();
		int res = 0;
		for (int j = 0; j <= n; j++) {
			std::pair<int, int> range = {std::max(ranges[j].first, l), std::min(ranges[j].second, r)};
			if (range.second <= range.first) continue;
			if (!((range.second - range.first) & 1)) continue;
			if (p >= (int) poly[j].size()) continue;
			res ^= (int64_t) mult[j] * poly[j][p] % MOD;
		}
		printf("%d\n", res);
	}
	return 0;
}