#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M> struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; }
  m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; }
  m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<998244353>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  for (auto&& e : a) cin >> e;
  sort(begin(a), end(a));
  vector dp(n, vector<mint>(n + 1));
  dp[0][0] = 1;
  for (int i = 0; i < n; ++i) {
    vector<mint> ndp(n + 1);
    for (int x = 0; x <= i; ++x) {
      ndp[x + 1] += dp[0][x];
      ndp[x] += dp[0][x] * (a[i] - 1);
    }
    swap(dp[0], ndp);
  }
  for (int i = 0; i < n - 1; ++i) {
    dp[i + 1] = dp[i];
    for (int x = n; x; --x) {
      dp[i + 1][x - 1] -= dp[i + 1][x] * (a[i] - 1);
    }
    for (int x = 0; x < n; ++x) {
      dp[i + 1][x] = dp[i + 1][x + 1] * a[i];
    }
    dp[i + 1][n] = 0;
  }
  while (q--) {
    int l, r, p;
    cin >> l >> r >> p;
    --l;
    int res = 0;
    for (int x = l; x < r; ++x) {
      int i = upper_bound(begin(a), end(a), x) - begin(a);
      res ^= dp[i][p].v;
    }
    cout << res << '\n';
  }
}