#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

vm C;
vm D;

struct Node {
    mint val;
    mint val2;
    ll size;
};

Node op(Node left, Node right) {
    if (left.size == 0) return right;
    if (right.size == 0) return left;
    return {left.val+left.val2*(D[right.size]-1)+right.val,
            left.val2*C[right.size]+right.val2,
            left.size+right.size};
}

Node e() { return {1, 0, 0}; }

mint pow2(mint x, long long n) {
    mint ret = 1;
    while (n > 0) {
        if (n & 1) ret = ret * x;  // n の最下位bitが 1 ならば x^(2^i) をかける
        x = x * x;
        n >>= 1;  // n を1bit 左にずらす
    }
    return ret;
}

mint geometric_progression(mint a, mint r, ll n) {
    return a*(pow2(r, n)-1)/(r-1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    ll N, M, K, Q;
    cin >> N >> M >> K >> Q;
    vl A(N); input(A);

    C.push_back(1);
    rep (_, N) C.push_back(C.back()*M);
    D.push_back(1);
    rep2 (i, 1, N+1) D.push_back(D.back()+C[i]);

    vector<Node> def(N);
    rep (i, N) def[i] = {A[i], A[i]-1, 1};
    segtree<Node, op, e> seg(def);
    while (Q--) {
        ll t; cin >> t;
        if (t == 1) {
            ll l, r; cin >> l >> r;
            l--; r--;
            auto res = seg.prod(l, r+1);
            mint ans = res.val;
            if (r-l+1 < K) {
                ans += res.val2*geometric_progression(M, M, K-(r-l+1));
            }
            print(ans.val());
        } else {
            ll x, y; cin >> x >> y;
            x--;
            seg.set(x, {y, y-1, 1});
        }
    }
}