#include <ios>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << '\n'; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

const ll mod = 998244353;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin, n, q;
    vector<ll> a(n);
    rep(i, 0, n) {
        cin, a[i];
    }
    sort(a.rbegin(), a.rend());

    auto dp = make_v(n + 1, n + 1, 0LL);
    dp[0][0] = 1;
    rep(i, 0, n) {
        rep(j, 0, n + 1) {
            if (j + 1 <= n) {
                dp[i + 1][j + 1] += dp[i][j];
                dp[i + 1][j + 1] %= mod;
            }
            dp[i + 1][j] += dp[i][j] * (a[i] - 1);
            dp[i + 1][j] %= mod;
        }
    }

    vector<ll> mul(n + 1, 1);
    rep(i, 0, n) {
        mul[n - i - 1] = mul[n - i] * a[n - i - 1];
        mul[n - i - 1] %= mod;
    }

    rep(_, 0, q) {
        int l, r, p;
        cin, l, r, p;
        ll ans = 0;
        rep(t, l, r + 1) {
            int it = upper_bound(a.rbegin(), a.rend(), t) - a.rbegin();
            ans ^= (dp[it][p] * mul[it]) % mod;
        }
        print(ans);
    }

    return 0;
}