#include <bits/stdc++.h>
const int N = 2e4 + 5;
const long long mod = 998244353, ot = 3;
long long qpow(long long x, long long y) {
  long long res = 1;
  x %= mod;
  y %= (mod - 1);
  if (y < 0) y += mod - 1;
  for (; y; x = x * x % mod, y >>= 1)
    if (y & 1) res = res * x % mod;
  return res;
}
void NTT(std::vector<long long> &a, int n, bool inv = 0) {
  for (int i = 0, j = 0; i < n; i++) {
    if (j > i) std::swap(a[i], a[j]);
    int k = n;
    while (j & (k >>= 1)) j &= ~k;
    j |= k;
  }
  long long p = inv ? -(mod - 1) / 2 : (mod - 1) / 2;
  for (int i = 1; i < n; i <<= 1) {
    long long c = qpow(ot, p / i), o = 1;
    for (int k = 0; k < i; k++, o = o * c % mod) {
      for (int j = k; j < n; j += i << 1) {
        int e = j + i;
        long long t = o * a[e] % mod;
        a[e] = (a[j] - t + mod) % mod;
        a[j] = (a[j] + t) % mod;
      }
    }
  }
  if (inv) {
    p = qpow(n, mod - 2);
    for (int i = 0; i < n; i++) a[i] = a[i] * p % mod;
  }
}
std::vector<long long> mul(std::vector<long long> a, std::vector<long long> b) {
  int la = a.size(), lb = b.size();
  int n = 1;
  while (n < la + lb - 1) n <<= 1;
  std::vector<long long> ans(n, 0);
  a.resize(n, 0);
  b.resize(n, 0);
  NTT(a, n, false);
  NTT(b, n, false);
  for (int i = 0; i < n; i++) ans[i] = a[i] * b[i] % mod;
  NTT(ans, n, true);
  return ans;
}
long long a[N], b[N];
std::vector<long long> solve(int l, int r) {
  std::vector<long long> ans;
  if (l == r) {
    ans.resize(2, 0);
    ans[0] = 1;
    ans[1] = b[l];
    return ans;
  }
  int mid = (l + r) >> 1;
  ans = mul(solve(l, mid), solve(mid + 1, r));
  while (ans.size() > 1 && ans.back() == 0) ans.pop_back();
  return ans;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%lld", a + i);
  int T;
  scanf("%d", &T);
  for (int op, l, r, d, q; T--;) {
    scanf("%d%d", &op, &q);
    if (op == 1) {
      scanf("%d%d", &l, &r);
      for (int i = 1; i <= n; i++) {
        if (i != l)
          b[i] = (q - a[i] + mod + mod) % mod;
        else
          b[i] = (q - r + mod + mod) % mod;
      }
    } else {
      scanf("%d%d%d", &l, &r, &d);
      for (int i = 1; i <= n; i++) {
        if (i < l || i > r)
          b[i] = (q - a[i] + mod + mod) % mod;
        else
          b[i] = (q - a[i] - d + mod + mod + mod) % mod;
      }
    }
    std::vector<long long> ans = solve(1, n);
    printf("%lld\n", ans.size() > k ? ans[k] : 0LL);
  }
  return 0;
}
