#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for(int i = 1; (i) <= (n); ++i)
#define forn(i, l, r) for(int i = (l); i <= (r); ++i)
#define ford(i, r, l) for(int i = (r); i >= (l); --i)
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define FORD(i, n) for(int i = ((n) - 1); i >= 0; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "BAI1"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
inline int readInt() {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong() {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}
const int N = 1e5 + 3;
const int M = 1e3;
const int LOG = 50;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
int n, q, k;
ll bit[N];
int a[N];
void update(int u, int v)
{
for(; u <= n; u += u & -u) bit[u] += v;
}
ll get(int u)
{
ll res = 0;
for(; u; u -= u & -u) res += bit[u];
return res;
}
set<int> s;
void solve()
{
cin >> n >> q >> k;
rep(i, n)
{
cin >> a[i];
if(a[i]) s.insert(i);
update(i, a[i]);
}
rep(i, q)
{
int type, x, y;
cin >> type >> x >> y;
if(type == 1)
{
if(s.find(x) != s.end()) s.erase(x);
update(x, y - a[x]);
a[x] = y;
if(a[x] > 0) s.insert(x);
} else if(type == 2)
{
if(k > 1)
{
auto u = s.lower_bound(x);
vector<int> tmp;
while(u != s.end() && *u <= y)
{
int idx = *u;
int new_val = a[idx] / k;
update(idx, new_val - a[idx]);
a[idx] = new_val;
if(a[idx] == 0) tmp.pb(idx);
++u;
}
for(int idx : tmp) s.erase(idx);
}
} else cout << get(y) - get(x - 1) << endl;
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int TC = 1;
if(fopen(task".inp", "r"))
{
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
if(fopen("note.inp", "r"))
{
freopen("note.inp", "r", stdin);
freopen("note.out", "w", stdout);
}
while(TC--)
{
solve();
cout << endl;
}
return 0;
}
