#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5;
int aa[N], bb[N];
const int mod = 998244353;
int powr(int a, int b) {
  a %= mod;
  int ans = 1;
  while (b) {
    if (b & 1) {
      ans = ((long long)ans * a) % mod;
    }
    a = ((long long)a * a) % mod;
    b >>= 1;
  }
  return ans;
}
int inv(int a, int b) { return powr(a, b - 2); }
class NTT {
  long long p, g, n, logn;

 public:
  NTT(long long P, long long G, long long LOGN) {
    p = P;
    long long g1 = G;
    logn = LOGN;
    n = (1 << LOGN);
    assert((p - 1) % n == 0);
    g = powr(g1, (p - 1) >> logn);
  }
  int bitrevcopy(int i) {
    int ret = 0;
    for (int j = 0; j < logn; j++)
      if (i & (1 << j)) ret |= (1 << (logn - 1 - j));
    return ret;
  }
  void fft(vector<int> &a, bool invert) {
    for (int i = 0; i < n; i++) {
      int br = bitrevcopy(i);
      if (i < br) swap(a[i], a[br]);
    }
    for (int i = 1; i <= logn; i++) {
      long long mul = powr(g, 1 << (logn - i));
      if (invert) mul = inv(mul, p);
      int add = (1 << i);
      for (int k = 0; k < n; k += add) {
        long long w = 1;
        long long lim = (add >> 1);
        for (int j = 0; j < lim; j++) {
          long long u = (w * a[k + j + lim]) % p, v = a[k + j];
          a[k + j] = u + v;
          if (a[k + j] >= p) a[k + j] -= p;
          a[k + j + lim] = v - u;
          if (a[k + j + lim] < 0) a[k + j + lim] += p;
          w = (w * mul) % p;
        }
      }
    }
    if (invert) {
      long long _inv = inv(n, p);
      for (int i = 0; i < n; i++) {
        a[i] = (a[i] * _inv) % p;
      }
    }
  }
};
vector<int> mul(vector<int> &a, vector<int> &b) {
  int sz = 1;
  int LG = 0;
  while (sz < (int)a.size() + (int)b.size()) sz <<= 1, LG++;
  NTT ntt(mod, 3, LG);
  a.resize(sz, 0);
  b.resize(sz, 0);
  ntt.fft(a, 0);
  ntt.fft(b, 0);
  for (int i = 0; i <= sz - 1; i++) {
    a[i] = ((long long)a[i] * b[i]) % mod;
  }
  ntt.fft(a, 1);
  return a;
}
vector<int> query(int l, int r) {
  if (l == r) {
    return {1, bb[l]};
  }
  int m = (l + r) >> 1;
  auto v1 = query(l, m);
  auto v2 = query(m + 1, r);
  return mul(v1, v2);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> aa[i];
    aa[i] %= mod;
  }
  int qq;
  cin >> qq;
  for (int tt = 1; tt <= qq; tt++) {
    int t;
    cin >> t;
    if (t == 1) {
      int q, idx, d;
      cin >> q >> idx >> d;
      for (int i = 1; i <= n; i++) {
        if (i == idx) {
          bb[i] = (q - d + mod);
        } else {
          bb[i] = (q - aa[i] + mod);
        }
        if (bb[i] >= mod) bb[i] -= mod;
      }
    } else {
      int q, l, r, d;
      cin >> q >> l >> r >> d;
      for (int i = 1; i <= n; i++) {
        if (l <= i && i <= r) {
          bb[i] = (q - aa[i] - d + mod) % mod;
        } else {
          bb[i] = q - aa[i] + mod;
        }
        if (bb[i] >= mod) bb[i] -= mod;
        if (bb[i] < 0) bb[i] += mod;
      }
    }
    auto v = query(1, n);
    cout << v[k] << '\n';
  }
  return 0;
}
