#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;

struct S {
  int d;
  mint acc, t;
};

mint tsz[100010], pow_m[100010];

S op(S f, S g) {
  return S{f.d + g.d, f.acc + f.t * tsz[g.d] + g.acc, f.t * pow_m[g.d] + g.t};
}
S e() { return {0, mint(), mint()}; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, mi, k, q;
  cin >> n >> mi >> k >> q;
  k++;
  mint m = mi;
  pow_m[0] = 1;
  rep(i, n) pow_m[i+1] = pow_m[i] * m;
  rep(i, n) tsz[i+1] = tsz[i] + pow_m[i];
  vector<S> init(n);
  rep(i, n) {
    int a;
    cin >> a;
    init[i] = {1, mint::raw(1), mint::raw(a - 1)};
  }
  segtree<S, op, e> seg(init);
  rep(_, q) {
    int op;
    cin >> op;
    if (op == 1) {
      int l, r;
      cin >> l >> r;
      auto [d, acc, t] = seg.prod(l - 1, r);
      int h = k - d;
      mint s;
      mint coeff = mint::raw(1);
      mint mp = m;
      while (h) {
        if (h & 1) {
          s += coeff;
          coeff *= mp * (mint::raw(1) + mp);
        } else {
          coeff *= mint::raw(1) + mp;
        }
        h >>= 1;
        mp *= mp;
      }
      mint ans = acc + t * s;
      cout << ans.val() << '\n';
    } else {
      int x, y;
      cin >> x >> y;
      seg.set(x - 1, {1, mint::raw(1), mint::raw(y - 1)});
    }
  }
}