//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;

typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);
const int MOD = 998244353;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const long double pi = 4 * atan(1);
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &x : v)
        is >> x;
    return is;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, q;
    cin >> n >> q;
    vector<ll> a(n);
    cin >> a;
    sort(ALL(a));
    vector<ll> front_v(n + 1, 0);
    front_v[0] = 1;
    rep(i, n)
    {
        front_v[i + 1] = front_v[i] * a[i] % MOD;
    }
    vector<vector<ll>> back_v(n+1, vector<ll>(n + 1, 0));
    back_v[n][0] = 1;
    int k = 1;
    for (int i = n - 1; i >= 0; i--)
    {
        rep(j, k)
        {
            back_v[i][j] += back_v[i + 1][j] * (a[i] - 1) % MOD;
            back_v[i][j+1] += back_v[i + 1][j];
            back_v[i][j + 1] %= MOD;
            back_v[i][j] %= MOD;
        }
        k++;
    }
    vector<ll> ans_v(q);
    rep(i, q)
    {
        ll l, r, count;
        cin >> l >> r >> count;
        ll ans = 0;
        for (ll j = l; j <= r; j++)
        {
            ll indr = lower_bound(ALL(a), j) - a.begin();
            ll res;
            if (indr == n)
            {
                res = 0;
            }
            else if (indr == 0)
            {
                res = back_v[indr][count];
            }
            else
            {
                res = back_v[indr][count] * front_v[indr];
            }
            res %= MOD;
            ans ^= res;
            //cout<<indr<<" ";
        }
        //cout<<"\n";
        ans_v[i] = ans;
    }
    rep(i, q) cout << ans_v[i] << "\n";
    /*
    debug(front_v);
    rep(i,n){
        debug(back_v[i]);
    }
    */
}