#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
using vc = pair<ll,vector<ll>>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 998244353;

int main(){
    int n,q;
    cin >> n >> q;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    sort(a.begin(),a.end(),greater<ll>());
    vector<vector<ll>> dp(n+1,vector<ll>(n+1,0));
    dp[0][0] = 1;
    for(int i=1;i<=n;i++){
        rep(j,n+1){
            if(j>0) dp[i][j] = (((a[i-1]-1)*dp[i-1][j])%MOD + dp[i-1][j-1])%MOD;
            else dp[i][j] = ((a[i-1]-1)*dp[i-1][j])%MOD;
        }
    }
    /*
    rep(i,n+1){
        rep(j,n+1) cout << dp[i][j] <<" " ;
        cout << endl;
    }
    */

    vector<ll> cum(n+2,1);
    rep(i,n) cum[i+1] = a[i];
    for(int i=n;i>=0;i--) cum[i] = (cum[i+1]*cum[i])%MOD;

    //rep(i,n+2) cout << cum[i] << " ";

    rep(i,q){
        int l,r,p;
        cin >> l >> r >> p;
        ll res = 0;
        for(int j=l;j<=r;j++){
            int left = 0,right = n+1;
            while(right - left > 1){
                int mid = (right + left)/2;
                if(a[mid-1] >= j) left = mid;
                else right = mid;
            }
            ll ret  = (dp[left][p] * cum[right])%MOD;
            //cout << left <<" " <<ret << " ";
            res ^= ret;
            res %= MOD;
        }
        cout << res << endl;
        //cout << endl;
    }

    return 0;
}