#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
long long n,m; 
long long pp;
long long t,ll,rr,kk;
struct node{
	long long s;
	long long l,r;
	long long lann=1;
	long long lan=0;
}tree[1000000];
long long ans=0;
void down(long long n){
	tree[n*2].s*=tree[n].lann;
	tree[n*2].s%=pp;
	tree[n*2+1].s*=tree[n].lann;
	tree[n*2+1].s%=pp;
	tree[n*2].lann*=tree[n].lann;
	tree[n*2].lann%=pp;
	tree[n*2+1].lann*=tree[n].lann;
	tree[n*2+1].lann%=pp;
	tree[n].lann=1;
	tree[n*2].lan+=tree[n].lan;
	tree[n*2].lan%=pp;
	tree[n*2+1].lan+=tree[n].lan;
	tree[n*2+1].lan%=pp;
	tree[n*2].s+=(tree[n*2].r-tree[n*2].l+1)*tree[n].lan;
	tree[n*2].s%=pp;
	tree[n*2+1].s+=(tree[n*2+1].r-tree[n*2+1].l+1)*tree[n].lan;
	tree[n*2+1].s%=pp;
	tree[n].lan=0;
	
}
void build(long long l,long long r,long long n){
	tree[n].l=l;
	tree[n].r=r;
	if(l==r){
		cin >>tree[n].s;
		return;
	}
	build(l,(l+r)/2,n*2);
	build((l+r)/2+1,r,n*2+1);
	tree[n].s=tree[n*2].s+tree[n*2+1].s;
	tree[n].s%=pp;
}
void qjcx(long long l, long long r,long long n){
	if(ll<=tree[n].l&&tree[n].r<=rr){
		ans+=tree[n].s;
		ans%=pp;
		return;
	}
	down(n);
	if(ll<=(l+r)/2)qjcx(l,(l+r)/2,n*2);
	if(rr>(l+r)/2)qjcx((l+r)/2+1,r,n*2+1);
}
void qjxg(long long l, long long r,long long n){
	if(ll<=tree[n].l&&tree[n].r<=rr){
		tree[n].s+=((r-l)+1)*kk;
		tree[n].s%=pp;
		tree[n].lan+=kk;
		tree[n].lan%=pp;
		return;
	}
	if(tree[n].lan||tree[n].lann!=1)down(n);
	if(ll<=(l+r)/2)qjxg(l,(l+r)/2,n*2);
	if(rr>(l+r)/2)qjxg((l+r)/2+1,r,n*2+1);
	tree[n].s=tree[n*2].s+tree[n*2+1].s;
	tree[n].s%=pp;
}
void qjxgg(long long l, long long r,long long n){
	if(ll<=tree[n].l&&tree[n].r<=rr){
		tree[n].s*=kk;
		tree[n].s%=pp;
		tree[n].lann*=kk;
		tree[n].lann%=pp;
		tree[n].lan*=kk;
		tree[n].lan%=pp;		
		return;
	}
	if(tree[n].lan||tree[n].lann!=1)down(n);
	if(ll<=(l+r)/2)qjxgg(l,(l+r)/2,n*2);
	if(rr>(l+r)/2)qjxgg((l+r)/2+1,r,n*2+1);
	tree[n].s=tree[n*2].s+tree[n*2+1].s;
	tree[n].s%=pp;
}
int main(){
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	cin >>n>>m>>pp;
	build(1,n,1);
	for(long long i=1;i<=m;i++){
		ans=0;
		cin >>t;
		if(t==1){
			cin >>ll>>rr>>kk;
			qjxgg(1,n,1);
		}
		if(t==2){
			cin >>ll>>rr>>kk;
			qjxg(1,n,1);
		}
		if(t==3){
			cin >>ll>>rr;
			qjcx(1,n,1);
			cout <<ans%pp<<endl;
		}
		int t=1,t1=1;
//		for(int j=1;j<=9;j++,t1++){
//			cout <<"["<<tree[j].l<<" "<<tree[j].r<<"]"<<":"<<tree[j].s<<" ";
//			if(t1==t){
//				cout <<endl;
//				t1=0;
//				t*=2;
//			}
//		}
//		cout <<endl;
	}
	return 0;
}