#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3e5 + 5;
int n, m, q;
int a[N], node[405000];
void build_tree(int i, int l, int r){
if(l > r) return;
if(l == r){
node[i] = a[l];
return;
}
int mid = (l + r) / 2;
build_tree(i * 2, l, mid);
build_tree(i * 2 + 1, mid + 1, r);
node[i] = node[i * 2] + node[i * 2 + 1];
}
void update(int i, int l, int r, int pos, int val){
if(l > r || l > pos || r < pos) return;
if(l == r){
if(l == pos)
node[i] = val;
return;
}
int mid = (l + r) / 2;
update(i * 2, l, mid, pos, val);
update(i * 2 + 1, mid + 1, r, pos, val);
node[i] = node[i * 2] + node[i * 2 + 1];
}
void update_2(int i, int l, int r, int a, int b){
if(node[i] == 0 || m == 1) return;
if(l > r || l > b || r < a) return;
if(l == r){
node[i] /= m;
return;
}
int mid = (l + r) / 2;
update_2(i * 2, l, mid, a, b);
update_2(i * 2 + 1, mid + 1, r, a, b);
node[i] = node[i * 2] + node[i * 2 + 1];
}
int get(int i, int l, int r, int a, int b){
if(l > r || l > b || r < a) return 0;
if(l >= a && r <= b) return node[i];
int mid = (l + r) / 2;
return get(i * 2, l, mid, a, b) + get(i * 2 + 1, mid + 1, r, a, b);
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> q >> m;
for(int i = 1; i <= n; ++ i)
cin >> a[i];
build_tree(1, 1, n);
while(q --){
int x, y, z;
cin >> x >> y >> z;
if(x == 1)
update(1, 1, n, y, z);
else if(x == 2)
update_2(1, 1, n, y, z);
else
cout << get(1, 1, n , y, z) << '\n';
}
}
