#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 2e9;
constexpr ll mod = 998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
int main() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  sort(a.begin(), a.end(), greater<int>());
  vector<mint> cum(n + 1, 0);
  cum[0] = 1;
  for (int i = 0; i < n; i++) cum[i + 1] = cum[i] * a[i];

  vector<vector<mint>> dp(n + 1, vector<mint>(n + 1, 0));

  dp[0][0] = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= n; j++) {
      dp[i + 1][j] += dp[i][j] * (a[i] - 1);
      if (j < n) dp[i + 1][j + 1] += dp[i][j];
    }
  }

  reverse(a.begin(), a.end());

  while (q--) {
    ll l, r, p;
    cin >> l >> r >> p;

    ll res = 0;
    for (ll x = l; x <= r; x++) {
      int itr = a.end() - lower_bound(a.begin(), a.end(), x);
      mint tmp = dp[itr][p] * cum[n] / cum[itr];
      res ^= tmp.x;
    }
    cout << res % mod << endl;
  }
  
  return 0;
}