#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;
const int N=4e5+5;
long long tr[N];
int lazy_add[N];
int n,q,m,op,x,y,k;
vector<int> lazy_mult(N);
int a[N];
void bui(int id,int l,int r){
    if(l==r){
        tr[id]=a[l];
        return;
    }
    int mid=(l+r)/2;
    bui(id*2,l,mid);
    bui(id*2+1,mid+1,r);
    tr[id]=tr[id*2]+tr[id*2+1];
}

void push_up(int id){
    tr[id]=tr[id*2]+tr[id*2+1];
}
void push_down(int id,int l,int r){
    if(lazy_mult[id]!=1){
        int mid=(l+r)/2;
        lazy_mult[id*2]=lazy_mult[id*2]*lazy_mult[id]%m;
        lazy_mult[id*2+1]=lazy_mult[id*2+1]*lazy_mult[id]%m;
        tr[id*2]=tr[id*2]*lazy_mult[id]%m;
        tr[id*2+1]=tr[id*2+1]*lazy_mult[id]%m;
        lazy_mult[id]=1;
    }
    if(lazy_add[id]){
        int mid=(l+r)/2;
        lazy_add[id*2]+=lazy_add[id]%m;
        lazy_add[id*2+1]+=lazy_add[id]%m;
        tr[id*2]+=lazy_add[id]*(mid-l+1)%m;
        tr[id*2+1]+=lazy_add[id]*(r-mid)%m;
        lazy_add[id]=0;
    }
}
void qjgx(int id,int l,int r,int x,int y,int v1,int v2){
    if(x<=l&&y>=r){
        lazy_add[id]+=v1%m;
        lazy_add[id]=lazy_add[id]*v2%m;
        lazy_mult[id]=lazy_mult[id]*v2%m;
        tr[id]=tr[id]*v2%m;
        tr[id]+=v1*(r-l+1)%m;
        return;
    }
    push_down(id,l,r);
    int mid=(l+r)/2;
    if(x<=mid){
        qjgx(id*2,l,mid,x,y,v1,v2);
    }
    if(y>mid){
        qjgx(id*2+1,mid+1,r,x,y,v1,v2);
    }
    push_up(id);
}
int find(int id,int l,int r,int x,int y){
    if(x<=l&&y>=r){
        return tr[id];
    }
    push_down(id,l,r);
    int mid=(l+r)/2;
    long long ans=0;
    if(x<=mid){
        ans+=find(id*2,l,mid,x,y)%m;
    }
    if(y>mid){
        ans+=find(id*2+1,mid+1,r,x,y)%m;
    }
    return ans%m;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    fill(lazy_mult.begin(),lazy_mult.end(),1);
    cin>>n>>q>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    bui(1,1,n);
    while(q--){
        cin>>op>>x>>y;
        if(op==1){
            cin>>k;
            qjgx(1,1,n,x,y,0,k);
        }
        if(op==2){
            cin>>k;
            qjgx(1,1,n,x,y,k,1);
        }
        if(op==3){
            cout<<find(1,1,n,x,y)%m<<endl;
        }
    }
    return 0;
}