#include<bits/stdc++.h>
#define int long long
#define lson node*2
#define rson node*2+1
using namespace std;
int n,m,l,r,k,sum[400001],a[100001],add[400001],mul[400001],op,mod;
void spread(int node,int l,int r){
    int mid=(l+r)/2;
    sum[lson]=(sum[lson]*mul[node]+add[node]*(mid-l+1))%mod;
    sum[rson]=(sum[rson]*mul[node]+add[node]*(r-mid))%mod;
    mul[lson]=(mul[lson]*mul[node])%mod;
    mul[rson]=(mul[rson]*mul[node])%mod;
    add[lson]=(add[lson]*mul[node]+add[node])%mod;
    add[rson]=(add[rson]*mul[node]+add[node])%mod;
    mul[node]=1;
    add[node]=0;
}
void build(int node,int l,int r){
    if(l==r){
        sum[node]=a[l]%mod;
        return;
    }
    int mid=(l+r)/2;
    build(lson,l,mid);
    build(rson,mid+1,r);
    sum[node]=(sum[lson]+sum[rson])%mod;
}
void addchange(int node,int l,int r,int L,int R,int val){
    if(L<=l&&r<=R){
	    add[node]=(add[node]+val)%mod;
        sum[node]=(sum[node]+val*(r-l+1))%mod;
        return;
    }
    spread(node,l,r);
    int mid=(l+r)/2;
    if(L<=mid) addchange(lson,l,mid,L,R,val);
    if(R>mid) addchange(rson,mid+1,r,L,R,val);
    sum[node]=(sum[lson]+sum[rson])%mod;
}
void mulchange(int node,int l,int r,int L,int R,int val){
    if(L<=l&&r<=R){
		add[node]=(add[node]*val)%mod;
		mul[node]=(mul[node]*val)%mod;
		sum[node]=(sum[node]*val)%mod;
        return;
	}
    spread(node,l,r);
    int mid=(l+r)/2;
    if(L<=mid) mulchange(lson,l,mid,L,R,val);
    if(R>mid) mulchange(rson,mid+1,r,L,R,val);
    sum[node]=(sum[lson]+sum[rson])%mod;
}
int query(int node,int l,int r,int L,int R){
    if(L<=l&&R>=r) return sum[node]%mod;
    spread(node,l,r);
    int mid=(l+r)/2,ans=0;
    if(L<=mid) ans=(ans+query(lson,l,mid,L,R))%mod;
    if(R>mid) ans=(ans+query(rson,mid+1,r,L,R))%mod;
    return ans%mod;
}
signed main(){
    cin>>n>>m>>mod;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a[i]%=mod;
    }
    build(1,1,n);
    while(m--){
        cin>>op;
        if(op==1){
            cin>>l>>r>>k;
            mulchange(1,1,n,l,r,k);
        }
        else if(op==2){
            cin>>l>>r>>k;
            addchange(1,1,n,l,r,k);
        }
        else{
            cin>>l>>r;
            cout<<query(1,1,n,l,r)<<endl;
        }
    }
}
/*
7 5 43
1 2 3 4 5 6 7
1 2 5 5
3 2 4
2 3 7 9
3 1 3
3 4 7
*/