#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  VI a(n);
  rep(i, n) cin >> a[i];
  sort(all(a));
  a.erase(unique(all(a)), a.end());
  ll n0 = a.size(), n1 = a.back() + 1 - a[0] - n0;
  mint base = a[0];
  VI d;
  for (int l = 0, r = 1; l < n; l = r++) {
    while (r < n && a[r] == a[r-1] + 1) r++;
    d.emplace_back(a[r-1] + 1 - a[l]);
    if (r < n) d.emplace_back(a[r] - (a[r-1] + 1));
  }
  rep(_, q) {
    int k, x, m;
    cin >> k >> x >> m;
    while (k && (n0 != m || n1 >= m)) {
      k--;
      base += d[0];
      n0 -= d[0];
      d.erase(d.begin());
      swap(n0, n1);
      if (n0 < m) {
        d.emplace_back(m - n0);
        n0 = m;
      } else {
        n1 -= d.back();
        d.pop_back();
        while (n0 != m) {
          if (n0 - m < d.back()) {
            d.back() -= n0 - m;
            n0 = m;
          } else {
            n0 -= d.back();
            d.pop_back();
            n1 -= d.back();
            d.pop_back();
          }
        }
      }
    }
    if (k) {
      d.emplace_back(m - n1);
      n1 += m - n1;
      int sz = ssize(d);
      int q = k / sz, r = k % sz;
      base += accumulate(all(d), mint()) * q;
      base += accumulate(d.begin(), d.begin() + r, mint());
      rotate(d.begin(), d.begin() + r, d.end());
      if (r % 2) swap(n0, n1);
      n1 -= d.back();
      d.pop_back();
    }
    int to_skip = x - 1;
    mint ans = base;
    rep(i, ssize(d)) {
      if (i % 2 == 0) {
        if (to_skip >= d[i]) to_skip -= d[i];
        else {
          cout << (ans + to_skip).val() << '\n';
          break;
        }
      }
      ans += d[i];
    }
  }
}