#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const ll linf = 1e18;
ll st[4 * N];
void Update(int node, int l, int r, int x, int y) {
if (l == r) {st[node] = y; return;}
int mid = l + r >> 1;
if (x <= mid) Update(2 * node, l, mid, x, y);
else Update(2 * node + 1, mid + 1, r, x, y);
st[node] = st[2 * node] + st[2 * node + 1];
}
void Spray(int node, int l, int r, int ql, int qr, int k) {
if (r < ql || qr < l || st[node] == 0) return;
if (l == r) {st[node] /= k; return;}
int mid = l + r >> 1;
Spray(2 * node, l, mid, ql, qr, k);
Spray(2 * node + 1, mid + 1, r, ql, qr, k);
st[node] = st[2 * node] + st[2 * node + 1];
}
ll Get(int node, int l, int r, int ql, int qr) {
if (r < ql || qr < l) return 0;
if (ql <= l && r <= qr) return st[node];
int mid = l + r >> 1;
return Get(2 * node, l, mid, ql, qr) + Get(2 * node + 1, mid + 1, r, ql, qr);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q, k;
cin >> n >> q >> k;
for (int i = 0; i < n; i++) {
int x; cin >> x;
Update(1, 0, n - 1, i, x);
}
while (q--) {
int ty, x, y;
cin >> ty >> x >> y;
if (ty == 1) Update(1, 0, n - 1, x - 1, y);
else if (ty == 2 && k > 1) Spray(1, 0, n - 1, x - 1, y - 1, k);
else cout << Get(1, 0, n - 1, x - 1, y - 1) << en;
}
return 0;
}
