#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<string>
#define ll long long
#define uint unsigned int
#define ull unsigned long long
using namespace std;
const int N=5e5+10;
const int Z=1e8+7;

ll n,m,mod;
ll a[Z];

inline ll read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') 
	{
		if(ch=='-') w=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		s=s*10+ch-'0';
		ch=getchar();
	}
	return s*w;
}

struct node{
	ll l,r;
	ll sum;
	ll add,mul;
}q[N];

inline void push_up(ll pos){
	q[pos].sum=(q[pos<<1].sum+q[pos<<1|1].sum)%mod;
}

inline void push_down(ll pos) {
	
	q[pos<<1].add=q[pos<<1].add*q[pos].mul+q[pos].add;
	q[pos<<1|1].add=q[pos<<1|1].add*q[pos].mul+q[pos].add;
	
	q[pos<<1].mul=(q[pos<<1].mul*q[pos<<1].mul) %mod;
	q[pos<<1|1].mul=(q[pos<<1|1].mul*q[pos<<1|1].mul) %mod;
	
	q[pos<<1].sum=(q[pos<<1].sum*q[pos].mul+q[pos].add*(q[pos<<1].r-q[pos<<1].l+1)) % mod;
	q[pos<<1|1].sum=(q[pos<<1|1].sum*q[pos].mul+q[pos].add*(q[pos<<1|1].r-q[pos<<1|1].l+1)) % mod;
	
	q[pos].add=0;
	q[pos].mul=1;
	
	return ;
}


void build(ll l,ll r,ll pos) {
	q[pos].l=l;q[pos].r=r;
	q[pos].add=0;q[pos].mul=1;
	if(l==r)
	{
		q[pos].sum=a[l];
		return ;
	}
	ll mid=l+((r-l)>>1);
	if(l<=mid) build(l,mid,pos<<1);
	if(r>mid) build(mid+1,r,pos<<1|1);
	push_up(pos);
}

void addv(ll l,ll r,ll temp,ll pos) {
	
	if(l<=q[pos].l&&q[pos].r<=r) {
		q[pos].add= (q[pos].add+temp) % mod;
		q[pos].sum=(q[pos].sum+(q[pos].r-q[pos].l+1)*temp)%mod;
		return ;
	}
	push_down(pos);
	ll mid=(q[pos].l+q[pos].r)>>1;
	// ll mid=q[pos].l+((q[pos].r-q[pos].l)>>1);
	if(l<=mid) addv(l,r,temp,pos<<1);
	if(r>mid) addv(l,r,temp,pos<<1|1);
	push_up(pos);
}

void mul(ll l,ll r,ll temp,ll pos) {
	if(l<=q[pos].l&&q[pos].r<=r) {
		q[pos].add=(q[pos].add*temp)%mod;
		q[pos].mul=(q[pos].mul*temp)%mod;
		q[pos].sum=(q[pos].sum*temp)%mod;
		return ;
	}
	
	push_down(pos);
	ll mid=(q[pos].l+q[pos].r)>>1;
	if(l<=mid) mul(l,r,temp,pos<<1);
	if(r>mid) mul(l,r,temp,pos<<1|1);
	push_up(pos);
}

ll getans(ll l,ll r,ll pos) {
	if(l<=q[pos].l&&q[pos].r<=r) {
		return q[pos].sum;
	}
	push_down(pos);
	ll mid=(q[pos].l+q[pos].r)>>1;
	ll sum=0;
	if(l<=mid) sum=(sum+getans(l,r,pos<<1))%mod;
	if(r>mid) sum=(sum+getans(l,r,pos<<1|1))%mod;
	return sum;
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("q.in","r",stdin);
	freopen("q.out","w",stdout);
#endif
	//ios::sync_with_stdio(false);	
	n=read(),m=read(),mod=read();
	for(ll i=1;i<=n;++i) a[i]=read();
	build(1,n,1);
	for(ll i=1;i<=m;++i){
		ll pd,x,y,k;
		pd=read();x=read();y=read();
		
		if(pd==1) {
			k=read();
			addv(x,y,k,1);
		}
		
		if(pd==2) {
			k=read();
			mul(x,y,k,1);
		}
		
		if(pd==3) {
			ll anss=getans(x,y,1);
			cout<<anss<<endl;
		}
	}
	return 0;		
}

找不到有什么问题。。。 （虽然连样例都过不了）