#pragma GCC optimize("O3,Ofast,unroll-loops")
#include "bits/stdc++.h"
const int MOD = 1e9 + 7;
using namespace std;
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define ll long long
#define S second
#define F first
void solve() {
int n, q, k;
cin >> n >> q >> k;
vi c(n);
for (int &i : c) cin >> i;
while (q--) {
int s, t, u;
cin >> s >> t >> u;
if (s == 1) {
c[t - 1] = u;
}
else if (s == 2) {
for (int i = t - 1; i < u; i++) {
c[i] /= k;
}
}
else {
ll sum = 0;
for (int i = t - 1; i < u; i++) {
sum += c[i];
}
cout << sum << endl;
}
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t = 1;
// cin >> t;
while (t--) solve();
}
