#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, numQuery, K;
int a[MAX];
struct segment_tree{
vector<int> st;
int n;
segment_tree(int _n){
this -> n = _n;
st.resize((n << 2));
}
void modify(int id, int l, int r, int p, int val){
if (p < l || p > r) return;
if (l == r){
st[id] = val; return;
}
int mid = (l + r) >> 1;
modify(id << 1, l, mid, p, val);
modify(id << 1 | 1, mid + 1, r, p, val);
st[id] = st[id << 1] + st[id << 1 | 1];
}
void updRange(int id, int l, int r, int u, int v){
if (u > r || v < l) return;
if (u <= l && v >= r){
if (st[id] == 0) return;
if (l == r){
st[id] /= K; return;
}
}
int mid = (l + r) >> 1;
updRange(id << 1, l, mid, u, v);
updRange(id << 1 | 1, mid + 1, r, u, v);
st[id] = st[id << 1] + st[id << 1 | 1];
}
int query(int id, int l, int r, int u, int v){
if (u > r || v < l) return 0;
if (u <= l && v >= r) return st[id];
int mid = (l + r) >> 1;
int ql = query(id << 1, l, mid, u, v);
int qr = query(id << 1 | 1, mid + 1, r, u, v);
return (ql + qr);
}
};
void Whisper(){
cin >> nArr >> numQuery >> K;
for (int i = 1; i <= nArr; ++i) cin >> a[i];
segment_tree st(nArr + 2);
for (int i = 1; i <= nArr; ++i) st.modify(1, 1, nArr, i, a[i]);
for (int i = 1; i <= numQuery; ++i){
int cmd, l, r; cin >> cmd >> l >> r;
if (cmd == 1){
st.modify(1, 1, nArr, l, r);
}
else if (cmd == 2){
if(K == 1) continue;
st.updRange(1, 1, nArr, l, r);
}
else{
cout << st.query(1, 1, nArr, l, r) << '\n';
}
}
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
