///https://www.instagram.com/_modwwe/
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c, d,e,f;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
// fin(task),fou(task);
#endif
NHP
/// cin>>s1;
// modwwe
phongbeo();
}
ib t[400001];
void upd(int node,int l,int r,int l1,int r1,int c)
{
if(l>r1||r<l1) return;
if(l>=l1&&r<=r1) {
t[node].a=c;
t[node].b=c;
return;}
int mid=l+r>>1;
upd(node<<1,l,mid,l1,r1,c);
upd(node<<1|1,mid+1,r,l1,r1,c);
t[node].a=t[node<<1].a+t[node<<1|1].a;
t[node].b=max(t[node<<1].b,t[node<<1|1].b);
}
void upd2(int node,int l,int r,int l1,int r1)
{
if(l>r1||r<l1||t[node].b==0) return ;
if(l==r){t[node].a/=k,t[node].b/=k; return;}
int mid=l+r>>1;
upd2(node<<1,l,mid,l1,r1);
upd2(node<<1|1,mid+1,r,l1,r1);
t[node].b=max(t[node<<1].b,t[node<<1|1].b);
t[node].a=t[node<<1].a+t[node<<1|1].a;
}
int get(int node,int l,int r,int l1,int r1)
{
if(l>r1||r<l1) return 0;
if(l>=l1&&r<=r1) return t[node].a;
int mid=l+r>>1;
return get(node<<1,l,mid,l1,r1)+get(node<<1|1,mid+1,r,l1,r1);
}
void phongbeo()
{
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{
cin>>l;
upd(1,1,n,i,i,l);
}
for(int i=1;i<=m;i++)
{
cin>>l;
if(l==1)
{
cin>>l>>r;
upd(1,1,n,l,l,r);
}
else if(l==2)
{
cin>>l>>r;
if(k!=1)
upd2(1,1,n,l,r);
}
else
{
cin>>l>>r;
cout<<get(1,1,n,l,r),down
}
}
}
