#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
using namespace std;

int main()
{   
    int N, Q; cin >> N >> Q;
    long A[7000];
    REP(i, N) cin >> A[i];
    int l[7000], r[7000], p[7000];
    REP(i, Q) cin >> l[i] >> r[i] >> p[i];
    long mod = 998244353;

    sort(A, A+N);
    
    long dp1[7000], dp2[7000];
    long ans[7000];
    REP(i, N) ans[i] = 0l;
    long mulA[7000];
    mulA[N] = 1l;
    REP(i, N) mulA[N-1-i] = (mulA[N-i] * A[i]) % mod;
    //REP(i, N+1) cout << mulA[i] << " ";
    //cout << endl;
    
    REP(i, N+1) dp1[i] = 0l;
    dp1[0] = A[N-1]-1l;
    dp1[1] = 1l;
    REP(i, Q){
        for(int j=l[i]; j<=r[i]; j++){
            int za = (int)(lower_bound(A, A+N, j) - A);
            if(za == (N-1)){
                //cout << i << " " << j << " " << dp1[p[i]] * mulA[1] << endl;
                ans[i] ^= (dp1[p[i]] * mulA[1]) % mod; ans[i] %= mod;
            }
        }
    }

    long za[7000][7000];

    REP(k, Q){
        REP(i, N+1) za[k][i] = 0l;
        for(int j=l[k]; j<=r[k]; j++){
            int z = (int)(lower_bound(A, A+N, j) - A);
            za[k][z]++;
        }
    }


    for(int i = N-2; i>=0; i--){
        REP(j, N+1) dp2[j] = 0l;
        REP(j, N+1){
            dp2[j] += (dp1[j] * (A[i] - 1l)) % mod;
            dp2[j] %= mod;
        }
        REP(j, N){
            dp2[j+1] += dp1[j]; 
            dp2[j+1] %= mod;
        }
        REP(j, N+1) dp1[j] = dp2[j];

        REP(k, Q){
            long temp = (dp1[p[k]] * mulA[N-i]) % mod;
            if(za[k][i]%2!=0){
                ans[k] ^= (dp1[p[k]] * mulA[N-i]) % mod; ans[k] %= mod;
            }
        }
    }
    REP(i, Q) cout << ans[i] << endl;
    
    
    return 0;
}