#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

ll P = 998244353;

int main(int argc, char const *argv[]) {
  ll n, q;std::cin >> n >> q;
  vll a(n);re(i, n) std::cin >> a[i];

  sort(all(a));
  reverse(all(a));
  vvl dp = VV(n+1, n+1, 0, ll);//i de j ball
  dp[0][0] = 1;
  for(int i=0;i<n;i++){
    for(int j=0;j<=n;j++){
      //使わない場合
      dp[i+1][j] = (dp[i+1][j] + (dp[i][j] * (a[i] - 1))%P)%P;
      //使う場合
      dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j])%P;
    }
  }
  std::cout << dp[3][0] << '\n';
  for(int i=0;i<=n;i++){
    ll mul = 1;
    for(int j=i+1;j<=n;j++){
      ll x = j-1;
      mul = (mul * a[x])%P;
    }
    for(int j=0;j<=n;j++) dp[i][j] = (dp[i][j] * mul)%P;
  }
  reverse(all(a));

  for(int i=0;i<q;i++){
    ll l, r, p;std::cin >> l >> r >> p;
    //ll lb = lower_bound(all(a), l) - a.begin();//l未満いくつ
    //ll up = n - lb;
    ll ret = 0;
    for(int j=l;j<=r;j++){
      ll lb = lower_bound(all(a), j) - a.begin();//l未満いくつ
      ll up = n - lb;
      ret ^= dp[up][p];
    }
    std::cout << ret << '\n';
  }
  return 0;
}