#include <bits/stdc++.h>
#define time() cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n"
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define FORLL(i, a, b) for (ll i = a, _b = b; i <= _b; ++i)
#define FORDLL(i, a, b) for (ll i = a, _b = b; i >= _b; --i)
#define all(x) x.begin(), x.end()
#define uni(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void __print_one(const char *&s, const T &x)
{
while (*s == ' ') ++s;
const char *p = s;
int bal = 0;
while (*s)
{
if (*s == '(') ++bal;
else if (*s == ')') --bal;
else if (*s == ',' && bal == 0) break;
++s;
}
cerr.write(p, s - p) << " = " << x;
if (*s == ',')
{
cerr << " , ";
++s;
}
}
template<typename... Args>
void debug(const char *s, Args... args)
{
cerr << "[ ";
int dummy[] = { 0 , (__print_one(s, args), 0)... };
(void)dummy;
cerr << " ]\n\n";
}
template<class X>
bool maximize(X &a, X b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template<class X>
bool minimize(X &a, X b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
// -----------------------------------------------------------------
const int maxn = 1e5 + 3;
int n, q;
ll K, a[maxn];
struct Node
{
ll ma, sum;
Node()
{
ma = -1e18;
sum = 0;
}
};
Node seg[maxn << 2];
// -----------------------------------------------------------------
Node combine(const Node &a, const Node &b)
{
Node c;
c.ma = max(a.ma, b.ma);
c.sum = a.sum + b.sum;
return c;
}
void upd(int id, int l, int r, int pos, ll val)
{
if (l == r)
{
seg[id].ma = seg[id].sum = val;
return;
}
int mid = l + r >> 1;
if (pos <= mid) upd(id << 1, l, mid, pos, val);
else upd(id << 1 | 1, mid + 1, r, pos, val);
seg[id] = combine(seg[id << 1], seg[id << 1 | 1]);
}
void updDiv(int id, int l, int r, int u, int v)
{
if (l > v || r < u || seg[id].ma == 0) return;
if (l == r)
{
seg[id].ma = seg[id].sum = seg[id].ma / K;
return;
}
int mid = l + r >> 1;
updDiv(id << 1, l, mid, u, v); updDiv(id << 1 | 1, mid + 1, r, u, v);
seg[id] = combine(seg[id << 1], seg[id << 1 | 1]);
}
ll get(int id, int l, int r, int u, int v)
{
if (l > v || r < u) return 0ll;
if (l >= u && r <= v) return seg[id].sum;
int mid = l + r >> 1;
return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
}
void solve()
{
cin >> n >> q >> K;
FOR(i, 1, n)
{
cin >> a[i];
upd(1, 1, n, i, a[i]);
}
while (q--)
{
int op; cin >> op;
if (op == 1)
{
int pos; ll val; cin >> pos >> val;
upd(1, 1, n, pos, val);
}
else if (op == 2)
{
int l, r; cin >> l >> r;
if (K == 1) continue;
if (l > r) continue;
updDiv(1, 1, n, l, r);
}
else
{
int l, r; cin >> l >> r;
if (l > r)
{
cout << "0\n";
continue;
}
cout << get(1, 1, n, l, r) << '\n';
}
}
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define TASK "test"
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
freopen(TASK".OUT", "w", stdout);
}
solve();
return 0;
}
