#include <bits/stdc++.h>
/*
Brute to win
*/
using namespace std;
using ll = long long;
#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 19;
int n, q, k;
struct ST {
vector <pii> st;
ST (int _n) {
st.assign(4 * (_n + 1), make_pair(0, 0));
}
void update1(int i, int l, int r, int pos, int val) {
if (l == r) {
st[i].fi = val;
st[i].se = val;
return;
}
int mid = (l + r) / 2;
if (pos <= mid) update1(2 * i, l, mid, pos, val);
else update1(2 * i + 1, mid + 1, r, pos, val);
st[i].fi = st[2 * i].fi + st[2 * i + 1].fi;
st[i].se = max(st[2 * i].se, st[2 * i + 1].se);
}
void update2(int i, int l, int r, int u, int v, int val) {
if (u > r || v < l) return;
if (st[i].se == 0) return;
if (l == r) {
st[i].fi /= k;
st[i].se /= k;
return;
}
int mid = (l + r) / 2;
update2(2 * i, l, mid, u, v, val);
update2(2 * i + 1, mid + 1, r, u, v, val);
st[i].fi = st[2 * i].fi + st[2 * i + 1].fi;
st[i].se = max(st[2 * i].se, st[2 * i + 1].se);
}
int get(int i, int l, int r, int u, int v) {
if (u > r || v < l) return 0;
if (u <= l && r <= v) return st[i].fi;
int mid = (l + r) / 2;
return get(2 * i, l, mid, u, v) + get(2 * i + 1, mid + 1, r, u, v);
}
} st(N);
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (fopen(".inp", "r")) {
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
cin >> n >> q >> k;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
st.update1(1, 1, n, i, x);
}
for (int i = 1; i <= q; i++) {
int type, x, y;
cin >> type >> x >> y;
if (type == 1) {
st.update1(1, 1, n, x, y);
}
else if (type == 2) {
if (k == 1) continue;
st.update2(1, 1, n, x, y, k);
}
else {
cout << st.get(1, 1, n, x, y) << '\n';
}
}
return 0;
}
