#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
//const ll dy[8]={-1,0,1,0,1,1,-1,-1};
//const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,q;cin >> n >>q;
    vl a(n);rep(i,n)cin >> a[i];
    sort(all(a));rev(all(a));
    vector<vector<ll>> dp(n+1,vector<ll>(n+1));
    dp[0][0]=1;
    rep(i,n){
        rep(j,n){
            dp[i+1][j+1]+=dp[i][j];
            dp[i+1][j+1]%=MOD9;
            dp[i+1][j]+=dp[i][j]*(a[i]-1);
            dp[i+1][j]%=MOD9;
        }
    }
    rev(all(a));
    ll cum=1;
    rep(i,n+1){
        rep(j,n+1){
            dp[n-i][j]*=cum;
            dp[n-i][j]%=MOD9;
        }
        if(i==n)break;
        cum*=a[i];
    }
    /*rep(i,n+1){
        rep(j,n+1){
            cout << dp[i][j] <<" ";
        }
        cout << endl;
    }*/
    while(q--){
        ll l,r,p;cin >> l >> r >>p;
        ll ans=0;
        for(int i=l;i<=r;i++){
            ll q=lower_bound(all(a),i)-a.begin();
            ans^=dp[n-q][p];
        }
        ans%=MOD;
        cout << ans <<endl;
    }
}