#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 15;
inline ll get(void) {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
ll ret = 0;
while (c >= '0' && c <= '9')
ret = ret * 10 + (c - '0'), c = getchar();
return ret;
}
struct Node{
ll sum, mx;
Node(ll a = 0, ll b = 0) : sum(a), mx(b) { }
Node operator + (Node other){
return Node(sum + other.sum, max(mx, other.mx));
}
} seg[4 * MAX];
ll n, q, k, v[MAX];
void build(int p, int l, int r){
if(l == r){
seg[p] = Node(v[l], v[l]);
return;
}
int m = (l + r) >> 1, e = 2 * p, d = e + 1;
build(e, l, m); build(d, m + 1, r);
seg[p] = seg[e] + seg[d];
}
ll query(int a, int b, int p, int l, int r){
if(a > r || b < l) return 0;
if(a <= l && r <= b) return seg[p].sum;
int m = (l + r) >> 1, e = 2 * p, d = e + 1;
return query(a, b, e, l, m) + query(a, b, d, m + 1, r);
}
void update(int i, ll x, int p, int l, int r){
if(l == r){
seg[p] = Node(x, x);
return;
}
int m = (l + r) >> 1, e = 2 * p, d = e + 1;
if(i <= m) update(i, x, e, l, m);
else update(i, x, d, m + 1, r);
seg[p] = seg[e] + seg[d];
}
void spray(int a, int b, int p, int l, int r){
if(seg[p].mx == 0 || a > r || b < l) return;
if(l == r){ seg[p].sum /= k; seg[p].mx /= k; return; }
int m = (l + r) >> 1, e = 2 * p, d = e + 1;
spray(a, b, e, l, m); spray(a, b, d, m + 1, r);
seg[p] = seg[e] + seg[d];
}
int32_t main(void){
n = get(); q = get(); k = get();
for(int i = 1; i <= n; i++) v[i] = get();
build(1, 1, n);
while(q--){
int op = get(), a = get(), b = get();
if(op == 1) update(a, b, 1, 1, n);
else if(op == 2) spray(a, b, 1, 1, n);
else cout << query(a, b, 1, 1, n) << '\n';
}
}
