/**
	author:  shobonvip
	created: 2024.11.12 01:09:32
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, q; cin >> n >> q;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];

	vector<mint> ans(n+1, 0);
	ans[0] = 1;
	rep(i,0,n){
		ans[0] *= a[i];
	}

	set<tuple<ll,ll,ll>> event;
	rep(i,0,q){
		ll l, r, p; cin >> l >> r >> p;
		for (ll j=l; j<=r; j++){
			event.insert(make_tuple(- j, i, p));
		}		
	}

	rep(i,0,n){
		event.insert(make_tuple(- a[i], - 1, 0));
	}

	vector<ll> ret_non998(q);
	for (auto [t, typ, v]: event) {
		t = -t;
		typ = -typ;
		if (typ <= 0) {
			ret_non998[- typ] ^= ans[v].val();
		}else{
			mint keis = mint(t).inv();
			rep(j,0,n+1){
				ans[j] *= keis;
			}
			vector<mint> ndp(n+1);
			rep(j,0,n+1){
				if(j+1 <= n){
					ndp[j+1] += ans[j];
				}
				ndp[j] += ans[j] * (t - 1);
			}
			swap(ans, ndp);
		}
	}

	rep(i,0,q){
		cout << mint(ret_non998[i]).val() << '\n';
	}

}