#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll MOD = 998244353;
    ll n, q;
    cin >> n >> q;
    ll a[n], b[q];
    rep(i,n)cin >> a[i];
    sort(a,a+n,greater<ll>());
    ll aa[n];
    rep(i,n)aa[i] = a[n-1-i];

    ll dp[n][n+10];
    rep(i,n)rep(j,n+10)dp[i][j] = 0;

    rep(i,n){
        if(i == 0){
            dp[i][0] = a[i] - 1;
            dp[i][1] = 1;
        }else{
            rep(j,n+1){
                dp[i][j+1] = dp[i-1][j];
                if(j == 0){
                    dp[i][j] = (dp[i-1][j]*(a[i]-1)%MOD) % MOD;
                }else{
                    dp[i][j] = (dp[i-1][j]*(a[i]-1)%MOD + dp[i-1][j-1]) % MOD;
                }   
                
            }
        }
    }

    ll mul[n+1];
    mul[n] = 1;
    drep(i,n){
        mul[i] = mul[i+1] * a[i] % MOD;
    }

    rep(i,q){
        ll l,r,p;
        cin >> l >> r >> p;
        ll ans = 0;
        srep(j,l,r+1){
            ll cnt = n - (int)(lower_bound(aa,aa+n,j) - aa);
            // cout << j << ' ' << cnt << endl;
            ll tmp = dp[cnt-1][p] * mul[cnt] % MOD;
            // cout << tmp << endl;
            ans ^= tmp;
        }
        cout << ans << endl;
    }

    return 0;
}