#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int n, q, k, a[N], tmax[N * 4];
long long t[N * 4];
void build (int id, int l, int r){
if (l == r){
t[id] = tmax[id] = a[l];
return;
}
int m = l + r >> 1;
build(id << 1, l, m);
build(id << 1 | 1, m + 1, r);
t[id] = (t[id << 1] + t[id << 1 | 1]);
tmax[id] = max(t[id << 1], t[id << 1 | 1]);
return;
}
void upd (int id, int l, int r, int u, int v){
if (l > v || r < u || tmax[id] == 0){
return;
}
if (l == r){
t[id] /= k;
tmax[id] /= k;
return;
}
int m = l + r >> 1;
if (m >= u){
upd(id << 1, l, m, u, v);
}
if (m < v){
upd(id << 1 | 1, m + 1, r, u, v);
}
t[id] = (t[id << 1] + t[id << 1 | 1]);
tmax[id] = max(tmax[id << 1], tmax[id << 1 | 1]);
return;
}
void assign (int id, int l, int r, int i, int x){
if (l == r){
t[id] = tmax[id] = x;
return;
}
int m = l + r >> 1;
if (i <= m){
assign(id << 1, l, m, i, x);
} else {
assign(id << 1 | 1, m + 1, r, i, x);
}
t[id] = (t[id << 1] + t[id << 1 | 1]);
tmax[id] = max(tmax[id << 1], tmax[id << 1 | 1]);
return;
}
long long get (int id, int l, int r, int u, int v){
if (l > v || r < u){
return 0ll;
}
if (l >= u && r <= v){
return t[id];
}
int m = l + r >> 1;
return (get(id << 1, l, m, u, v) + get(id << 1 | 1, m + 1, r, u, v));
}
int32_t main (){
ios::sync_with_stdio(false); cin.tie(nullptr);
if (fopen ("test.inp", "r")){
freopen ("test.inp", "r", stdin);
freopen ("test.out", "w", stdout);
}
cin >> n >> q >> k;
for (int i = 1; i <= n; ++i){
cin >> a[i];
}
build(1, 1, n);
for (int i = 1; i <= q; ++i){
int tp, x, y; cin >> tp >> x >> y;
if (tp == 1){
assign(1, 1, n, x, y);
} else
if (tp == 2){
upd(1, 1, n, x, y);
} else
if (tp == 3){
cout << get(1, 1, n, x, y) << "\n";
}
}
}
