#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e5 + 9;
const ll mod = 1e9 + 7;
const ll Log2 = 20;
typedef pair<ll,ll> LL;
ll n,Q,k,x;
ll st[4*N];
void upd(ll id,ll l,ll r,ll u,ll val){
if (u < l||r < u) return;
if (l == r){
st[id] = val; return;
}
ll mid = (l + r)/2;
upd(id*2,l,mid,u,val); upd(id*2 + 1,mid + 1,r,u,val);
st[id] = st[id*2] + st[id*2 + 1];
}
ll Get(ll id,ll l,ll r,ll u,ll v){
if (v < l||r < u) return 0;
if (u <= l&&r <= v) return st[id];
ll mid = (l + r)/2;
return Get(id*2,l,mid,u,v) + Get(id*2 + 1,mid + 1,r,u,v);
}
ll Walk(ll id,ll l,ll r,ll val){
///first value which > val
if (l == r){
if (st[id] > val) return l;
return n + 1;
}
ll mid = (l + r)/2;
if (st[id*2] > val) return Walk(id*2,l,mid,val);
return Walk(id*2 + 1,mid + 1,r,val - st[id*2]);
}
ll type,l,r;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define task "tst"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
//freopen(task".out", "w", stdout);
}
cin>>n>>Q>>k;
for (ll i = 1;i <= n;i++) cin>>x,upd(1,1,n,i,x);
while(Q--){
cin>>type>>l>>r;
if (type == 1) upd(1,1,n,l,r);
else if (type == 2){
if (k > 1){
while(l <= r){
ll now = Get(1,1,n,l,l); now /= k;
upd(1,1,n,l,now); l = Walk(1,1,n,Get(1,1,n,1,l));
}
}
}
else cout<<Get(1,1,n,l,r)<<"\n";
}
}
