#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
const ll INF=1e18;
const int mod=998244353;

int main(){
    int n,q;cin>>n>>q;
    vll a(n);rep(i,n)cin>>a[i];
    sort(all(a));
    vll multi(n+1);//i個目までの積
    multi[0]=1;
    rep(i,n){
        multi[i+1]=multi[i]*a[i];
        multi[i+1]%=mod;
    }
    reverse(all(a));
    vvll dp(n+1,vll(n+1));//dp[i][j]:i個目の箱までから球を一個ずつ取り出して色1がj個含まれる場合の数
    dp[0][0]=1;
    rep(i,n)rep(j,n+1){
        if(j>i+1)continue;
        dp[i+1][j]=(a[i]-1)*dp[i][j];
        if(j>0)dp[i+1][j]+=dp[i][j-1];
        dp[i+1][j]%=mod;
    }
    int l,r,p,start,last,middle;
    ll sum,tmp;
    vll ans(q);
    rep(i,q){
        cin>>l>>r>>p;
        rep2(j,l,r+1){
            start=-1;
            last=n;
            while(last-start>1){
                middle=(start+last)/2;
                if(a[middle]<j)last=middle;
                else start=middle;
            }//start+1個j以上
            if(start+1<p){
                if(j==l)sum=0;
                else sum^=0;
                break;
            }
            tmp=(dp[start+1][p]*multi[n-start-1])%mod;
            if(j==l)sum=tmp;
            else sum^=tmp;
        }
        ans[i]=sum;
    }
    rep(i,q)cout<<ans[i]<<endl;
}