#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

const ll MOD = 998244353;
int N, Q;
ll A[10000], B[10000]; 

ll dp[6005][6005];
ll pr[6005];

void init(){
    dp[0][0] = 1;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j <= N; j++){
            dp[i][j] = 0;
        }
        for(int j = 0; j <= i-1; j++){
            // 1
            dp[i][j+1] += dp[(i-1)][j];
            dp[i][j+1] %= MOD;
            // 1 以外
            dp[i][j] += dp[(i-1)][j]*(A[i-1]-1);
            dp[i][j] %= MOD;
        }
    }
    pr[N] = 1;
    for(int i = N-1; i >= 0; i--){
        pr[i] = pr[i+1]*A[i];
        pr[i] %= MOD;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> Q;
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A, A+N, greater<int>());
    init();
    
    for(int i = 0; i < Q; i++){
        int l, r, p;
        cin >> l >> r >> p;
        ll ans = 0;
        int cur = 0;
        for(int j = r; j >= l; j--){
            while(A[cur] >= j){
                cur++;
            }
            ll tmp = (dp[cur][p]*pr[cur])%MOD;
            ans ^= tmp;
        }
        cout << ans%MOD << endl; 
    }
}