/**
* author: m371
* created: 06.11.2021 23:29:50
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T>
class fenwick {
public:
vector<T> fenw;
int n;
fenwick(int _n) : n(_n) {
fenw.resize(n);
}
void modify(int x, T v) {
while (x < n) {
fenw[x] += v;
x |= (x + 1);
}
}
T get(int x) {
T v{};
while (x >= 0) {
v += fenw[x];
x = (x & (x + 1)) - 1;
}
return v;
}
};
const int N = 1e5 + 5;
const int MAX = 4 * N;
int n, q, k;
long long mx[MAX], sum[MAX];
void modify(int x, int l, int r, int pos, int val) {
if (l == r) {
mx[x] = sum[x] = val;
return;
}
int mid = l + r >> 1;
if (pos <= mid) {
modify(x + x, l, mid, pos, val);
} else {
modify(x + x + 1, mid + 1, r, pos, val);
}
mx[x] = max(mx[x + x], mx[x + x + 1]);
sum[x] = sum[x + x] + sum[x + x + 1];
}
void update(int x, int l, int r, int ll, int rr) {
if (l > r || l > rr || r < ll || mx[x] == 0) {
return;
}
if (l == r) {
mx[x] = sum[x] = (mx[x] / k);
return;
}
int mid = l + r >> 1;
update(x + x, l, mid, ll, rr);
update(x + x + 1, mid + 1, r, ll, rr);
mx[x] = max(mx[x + x], mx[x + x + 1]);
sum[x] = sum[x + x] + sum[x + x + 1];
}
long long get(int x, int l, int r, int ll, int rr) {
if (l > r || l > rr || r < ll) return 0;
if (ll <= l && r <= rr) return sum[x];
int mid = l + r >> 1;
return get(x + x, l, mid, ll, rr) + get(x + x + 1, mid + 1, r, ll, rr);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (k == 1) {
fenwick<long long> fenw(n);
for (int i = 0; i < n; i++) {
fenw.modify(i, a[i]);
}
while (q--) {
int foo;
cin >> foo;
if (foo == 1) {
int pos, val;
cin >> pos >> val;
--pos;
fenw.modify(pos, val - a[pos]);
a[pos] = val;
}
if (foo == 2) {
int l, r;
cin >> l >> r;
}
if (foo == 3) {
int l, r;
cin >> l >> r;
--l, --r;
cout << fenw.get(r) - fenw.get(l - 1) << '\n';
}
}
} else {
for (int i = 0; i < n; i++) {
modify(1, 0, n - 1, i, a[i]);
}
for (int i = 0; i < q; i++) {
int foo;
cin >> foo;
if (foo == 1) {
int pos, val;
cin >> pos >> val;
--pos;
modify(1, 0, n - 1, pos, val);
}
if (foo == 2) {
int l, r;
cin >> l >> r;
--l, --r;
update(1, 0, n - 1, l, r);
}
if (foo == 3) {
int l, r;
cin >> l >> r;
--l, --r;
cout << get(1, 0, n - 1, l, r) << '\n';
}
}
}
return 0;
}
