#include<bits/stdc++.h>
using namespace std;
const int N=500500;
const int M=200808;
long long tree[N];
int tl[N],tr[N],tmid[N];
long long a[N];
int n,m,p;
int addlazy[N],multilazy[N];
void replace(int x){
	tree[x]=(tree[x*2]+tree[x*2+1])%p;
}
void make_tree(int x,int l,int r){
	tl[x]=l;
	tr[x]=r;
	if(l==r){
		tree[x]=a[l];
	}
	else{
		int mid=(l+r)/2;
		tmid[x]=mid;
		make_tree(x*2,l,mid);
		make_tree(x*2+1,mid+1,r);
		replace(x);
	}
}
void addpushdown(int x){
	if(tl[x]<tr[x]){
		tree[x*2]=((addlazy[x]*(tr[x*2]-tl[x*2]+1))%p+tree[x*2])%p;
		addlazy[x*2]=(addlazy[x*2]+addlazy[x])%p;
		tree[x*2+1]=((addlazy[x]*(tr[x*2+1]-tl[x*2+1]+1))%p+tree[x*2+1])%p;
		addlazy[x*2+1]=(addlazy[x*2+1]+addlazy[x])%p;
		addlazy[x]=0;
	}
}
void multipushdown(int x){
	if(tl[x]<tr[x]){
		tree[x*2]=((tree[x*2]*multilazy[x])%p*(tr[x*2]-tl[x*2]+1)%p)%p;
		multilazy[x*2]=((multilazy[x*2]*multilazy[x])%p)%p;
		tree[x*2+1]=((tree[x*2+1]*multilazy[x])%p*(tr[x*2+1]-tl[x*2+1]+1)%p)%p;
		multilazy[x*2+1]=((multilazy[x]*multilazy[x*2+1])%p)%p;
		multilazy[x]=1;
	}
}
void add(int x,int l,int r,int c){
	if(tl[x]==l && tr[x]==r){
		tree[x]=(tree[x]+(c*(l-r+1))%p)%p;
		return;
	}
	if(r<=tmid[x])
		add(x*2,l,r,c);
	if(l>tmid[x])
		add(x*2+1,l,r,c);
	else{
		add(x*2,l,tmid[x],c);
		add(x*2+1,tmid[x]+1,r,c);
	}
	replace(x);
}
void multi(int x,int l,int r,int c){
	if(tl[x]==l &&tr[x]==r){
		tree[x]=(tree[x]*(c*(l-r+1))%p)%p;
			return;
	}
	if(r<=tmid[x])
		multi(x*2,l,r,c);
	if(l>tmid[x])
		multi(x*2+1,l,r,c);
	else{
		multi(x*2,l,tmid[x],c);
		multi(x*2+1,tmid[x],r,c);
	}
	replace(x);
}
long long find(int x,int l,int r){
	if(tl[x]==l && tr[x]==r)
		return tree[x];
	if(r<=tmid[x])
		return find(x*2,l,r);
	if(l>tmid[x])
		return find(x*2+1,l,r);
	else{
		long long ans=find(x*2,l,tmid[x]);
		ans=(ans+find(x*2+1,tmid[x]+1,r))%p;
		return ans;
	}
}
int main(){
	int i,j;
	cin>>n>>m>>p;
	for(i=1;i<=n;i++)
		cin>>a[i];
	make_tree(1,1,n);
	for(i=1;i<=m;i++){
		int opt;
		cin>>opt;
		if(opt==1){
			int a,b,k;
			cin>>a>>b>>k;
			multi(1,a,b,k);
			continue;
		}
		if(opt==2){
			int a,b,k;
			cin>>a>>b>>k;
			add(1,a,b,k);
			continue;
		}
		if(opt==3){
			int a,b;
			cin>>a>>b;
			int ans=find(1,a,b)%p;
			cout<<ans<<"\n";
		}
	}
}