#include <bits/stdc++.h>
using namespace std;
#define int long long
struct SegmentTree{
vector<int> seg, mx;
int N, K;
void init(int n, int k){
N = n, K = k;
mx.resize((int) 5e6);
seg.resize((int) 5e6);
}
void update(int node, int start, int end, int l, int r){
if(start > r || end < l || mx[node] == 0 || K == 1) return;
if(start == end){
seg[node] /= K;
return;
}
int mid = start + (end - start) / 2;
update(node * 2 + 1, start, mid, l, r);
update(node * 2 + 2, mid + 1, end, l, r);
seg[node] = seg[node * 2 + 1] + seg[node * 2 + 2];
mx[node] = max(mx[node * 2 + 1], mx[node * 2 + 2]);
}
void set_val(int node, int start, int end, int idx, int val){
if(start == end){
seg[node] = mx[node] = val;
return;
}
int mid = start + (end - start) / 2;
if(idx <= mid) set_val(node * 2 + 1, start, mid, idx, val);
else set_val(node * 2 + 2, mid + 1, end, idx, val);
seg[node] = seg[node * 2 + 1] + seg[node * 2 + 2];
mx[node] = max(mx[node * 2 + 1], mx[node * 2 + 2]);
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return 0;
if(start >= l && end <= r) return seg[node];
int mid = start + (end - start) / 2;
return query(node * 2 + 1, start, mid, l, r) + query(node * 2 + 2, mid + 1, end, l, r);
}
int query(int l, int r){
return query(0, 1, N, l, r);
}
void set_val(int idx, int val){
set_val(0, 1, N, idx, val);
}
void update(int l, int r){
update(0, 1, N, l, r);
}
} tr;
signed main(){
ios::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int n, q, k;
cin >> n >> q >> k;
tr.init(n, k);
for(int i = 1, x; i <= n; ++i){
cin >> x;
tr.set_val(i, x);
}
while(q--){
int t, l, r;
cin >> t >> l >> r;
if(t == 1){
tr.set_val(l, r);
}else if(t == 2){
if(k > 1) tr.update(l, r);
}else{
cout << tr.query(l, r) << "\n";
}
}
return 0;
}
