awa

#include <bits/stdc++.h>
#define ll long long
#define int ll
using namespace std;
const int N=1e5+10;
int n,m,mod,a[N];
struct ST{
	struct point{
		int l,r;
		int maxn;//懒得改名了 
		int add,mul; 
	}tr[N<<2];
	void push_up(int u){
		tr[u].maxn=tr[2*u].maxn+tr[2*u+1].maxn;
	}
	void push_down(int u){
		tr[2*u].maxn=(tr[2*u].maxn*tr[u].mul)
        +tr[u].add*(tr[2*u].r-tr[2*u].l+1)%mod;
		tr[2*u+1].maxn=tr[2*u+1].maxn*tr[u].mul
        +tr[u].add*(tr[2*u+1].r-tr[2*u+1].l+1)%mod;
		tr[2*u].add=(tr[2*u].add*tr[2*u].mul+tr[u].add)%mod;
       tr[2*u+1].add=(tr[2*u+1].add*tr[2*u+1].mul+tr[u].add)%mod;
		tr[2*u].mul=(tr[2*u].mul*tr[u].mul)%mod;
		tr[2*u+1].mul=(tr[2*u+1].mul*tr[u].mul)%mod;
		tr[u].add=0;tr[u].mul=1;
	}
	void build(int u,int l,int r){
		if (l==r){
			tr[u]={l,r,a[l],0,1};
		}
		else{
			tr[u]={l,r,0,0,1};
			int mid=(l+r)>>1;
			build(2*u,l,mid);
			build(2*u+1,mid+1,r);
			push_up(u);
		}
	}
	void updateadd(int u,int l,int r,int c){
		if (tr[u].l>=l && tr[u].r<=r){
			tr[u].maxn+=c*(tr[u].r-tr[u].l+1);
			tr[u].add+=c;
			return ;
		}
		push_down(u);
		int mid=(tr[u].l+tr[u].r)/2;
		if (l<=mid) updateadd(2*u,l,r,c);
		if (r>mid) updateadd(2*u+1,l,r,c);
		push_up(u);
	}
	void updatemul(int u,int l,int r,int c){
		if (tr[u].l>=l && tr[u].r<=r){
			tr[u].maxn=(tr[u].maxn*c)%mod;
			tr[u].add=(tr[u].add*c)%mod;
			tr[u].mul=(tr[u].mul*c)%mod;
			return ;
		}
		push_down(u);
		int mid=(tr[u].l+tr[u].r)/2;
		if (l<=mid) updatemul(2*u,l,r,c);
		if (r>mid) updatemul(2*u+1,l,r,c);
		push_up(u);
	}
	int query(int u,int l,int r){
		if (tr[u].l>=l && tr[u].r<=r) return tr[u].maxn;
		push_down(u); 
		int mid=(tr[u].l+tr[u].r)>>1;
		int tot=0;
		if (l<=mid) tot=tot+query(2*u,l,r);
		if (r>mid) tot=tot+query(2*u+1,l,r);
		return tot;
	}
	
};  
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t=1;
	while (t--){
		cin>>n>>m>>mod;
		for (int i=1;i<=n;++i) cin>>a[i];
		ST tre;tre.build(1,1,n);
		while (m--){
			int tpe,x,y,z;cin>>tpe;
			if (tpe==3){
				cin>>x>>y;
				cout<<tre.query(1,x,y)%mod<<"\n";
			}
			else if(tpe==1){
				cin>>x>>y>>z;
				tre.updatemul(1,x,y,z);
			}
			else{
				cin>>x>>y>>z;
				tre.updateadd(1,x,y,z);
			}
		}
	}
	return 0;
}