#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define Neco "Sterilizing Spray"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 1e5 + 7
using namespace std;
const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r)
{
return uniform_int_distribution<ll> (l, r)(rng);
}
int n, q, k;
struct IT {
struct Node {
ll Amax, Sum;
} st[4 * maxn];
void update(int u, int v, int val, int id = 1, int l = 1, int r = n)
{
if(l > v || r < u) return;
if(st[id].Amax <= 0 && val < 0) return;
if(l == r) {
st[id].Sum = val < 0 ? st[id].Sum / k : val;
st[id].Amax = st[id].Sum;
return;
}
int mid = (l + r) >> 1;
update(u, v, val, _left), update(u, v, val, _right);
st[id].Amax = max(st[id * 2].Amax, st[id * 2 + 1].Amax);
st[id].Sum = st[id * 2].Sum + st[id * 2 + 1].Sum;
}
ll get(int u, int v, int id = 1, int l = 1, int r = n)
{
if(l > v || r < u) return 0;
if(u <= l && r <= v) return st[id].Sum;
int mid = (l + r) >> 1;
return get(u, v, _left) + get(u, v, _right);
}
} St;
void solve()
{
cin >> n >> q >> k;
int X;
fi(i, 1, n) cin >> X, St.update(i, i, X);
fi(i, 1, q) {
int type, x, y;
cin >> type >> x >> y;
if(type == 1) St.update(x, x, y);
if(type == 2) St.update(x, y, -1);
if(type == 3) cout << St.get(x, y) << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(Neco".inp", "r")) {
freopen(Neco".inp", "r", stdin);
freopen(Neco".out", "w", stdout);
}
int nTest = 1;
// cin >> nTest;
while(nTest--)
{
solve();
}
return 0;
}
