#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 3e5 + 12, MOD = 1e9 + 7;

int n,q,k,c[N];
ll t[N * 4], mx[N * 4], mn[N * 4], mod[N * 4];
void merge(int v){
    t[v] = t[v + v ] + t[v + v + 1];
    mx[v] = max(mx[v + v + 1],mx[v + v]);
    mn[v] = min(mn[v + v],mn[v + v + 1]);
}
void build(int v = 1,int tl = 1,int tr = n){
    if(tl == tr){
        mx[v] = mn[v] = t[v] = c[tl];
    }else
    {
        int tm = (tl + tr) >> 1;
        build(v + v,tl,tm);
        build(v + v + 1, tm + 1, tr);
        merge(v);
    }
}
void upd(int pos,int val,int v = 1,int tl = 1,int tr = n){
    if(tl == tr){
        mx[v] = mn[v] = t[v] = val;
    }else{
        int tm = (tl + tr) >> 1;
        if(pos <= tm) upd(pos,val,v+v,tl,tm);
        else upd(pos,val,v+v+1,tm+1,tr);
        merge(v);
    }
}
void upd1(int l,int r,int v = 1,int tl = 1,int tr = n){
    if(l > r || tl > r || l > tr || mx[v] == 0) return;
    if(tl == tr){
        t[v] /= k;
        mx[v] /= k;
        mn[v] /=k;
        return;
    }
    int tm = (tl + tr) >> 1;
    upd1(l,r,v+v,tl,tm);
    upd1(l,r,v+v+1,tm+1,tr);
    merge(v);
}
ll get(int l,int r,int v = 1,int tl = 1,int tr = n){
    if(l > r || tl > r || l > tr) return 0;
    if(tl >= l && tr <= r) return t[v];
    int tm = (tl + tr) >> 1;
    return get(l,r,v+v,tl,tm) + get(l,r,v+v+1,tm+1,tr);
}
void test() {
    cin >> n >> q >> k;
    for(int i = 1;i <= n;i++){
        cin >> c[i];
    }
    build();
    while(q--){
        int tp;
        cin >> tp;
        if(tp == 1){
            int a,b;
            cin >> a >> b;
            upd(a,b);
        }else if(tp == 2){
            int l,r;
            cin >> l >> r;
            if (k > 1) {
                upd1(l, r);
            }
        }else{
            int l,r;
            cin >> l >> r;
            cout << get(l,r) << '\n';
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int T = 1;
//    cin >> T;
    while(T--){
        test();
    }
}