【模板】线段树

//区间加，区间查询 
#include<cstdio>
#define lc (o<<1)
#define rc (o<<1|1)
const int N=1e5+10;
typedef long long ll;
int n,m;
ll a[N],sum[N*4],lazy[N*4];
void build(int o,int l,int r)
{
	if(l==r)
	{
		sum[o]=a[l];return;
	}
	int mid=(l+r)>>1;
	build(lc,l,mid);build(rc,mid+1,r);
	sum[o]=sum[lc]+sum[rc];
} 
void push_down(int o,int l,int r)
{
	if(!lazy[o])return;
	int mid=(l+r)>>1;
	lazy[lc]+=lazy[o];sum[lc]+=(mid-l+1)*lazy[o];
	lazy[rc]+=lazy[o];sum[rc]+=(r-mid)*lazy[o];
	lazy[o]=0;return;
}
void upd(int o,int l,int r,int nl,int nr,int v)
{
	if(nl<=l&&r<=nr)
	{
		sum[o]+=(r-l+1)*v;lazy[o]+=v;return;
	}
	push_down(o,l,r);
	int mid=(l+r)>>1;
	if(nl<=mid)upd(lc,l,mid,nl,nr,v);
	if(nr>mid)upd(rc,mid+1,r,nl,nr,v);
	sum[o]=sum[lc]+sum[rc];
}
ll que(int o,int l,int r,int nl,int nr)
{
	if(nl<=l&&r<=nr)return sum[o];
	push_down(o,l,r);
	int mid=(l+r)>>1;ll ans=0;
	if(nl<=mid)ans+=que(lc,l,mid,nl,nr);
	if(nr>mid)ans+=que(rc,mid+1,r,nl,nr);
	return ans;
}
int main()
{
	//freopen("in.txt","r",stdin);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
    build(1,1,n);
    while(m--)
    {
    	int op,x,y,k;
    	scanf("%d%d%d",&op,&x,&y);
    	if(op&1)scanf("%d",&k),upd(1,1,n,x,y,k);
	    else printf("%lld\n",que(1,1,n,x,y));
	}
	return 0;
}
//区间加，区间乘，区间查询
#include<cstdio>
#define lc (o<<1)
#define rc (o<<1|1)
const int N=1e5+10;
typedef long long ll;
int n,m,p;
ll a[N],sum[N*4],lazy[N*4],lm[N*4];
void build(int o,int l,int r)
{
	lm[o]=1;
	if(l==r)
	{
		sum[o]=a[l];return;
	}
	int mid=(l+r)>>1;
	build(lc,l,mid);build(rc,mid+1,r);
	sum[o]=(sum[lc]+sum[rc])%p;
} 
void push_down(int o,int l,int r)
{
	if(lm[o]!=1)
	{
		lm[lc]=lm[lc]*lm[o]%p;sum[lc]=sum[lc]*lm[o]%p;
		lm[rc]=lm[rc]*lm[o]%p;sum[rc]=sum[rc]*lm[o]%p;
		lazy[lc]=lazy[lc]*lm[o]%p;lazy[rc]=lazy[rc]*lm[o]%p;
		lm[o]=1;
	}
	if(lazy[o])
	{
		int mid=(l+r)>>1;
	    lazy[lc]=(lazy[lc]+lazy[o])%p;sum[lc]=(sum[lc]+(mid-l+1)*lazy[o]%p)%p;
	    lazy[rc]=(lazy[rc]+lazy[o])%p;sum[rc]=(sum[rc]+(r-mid)*lazy[o]%p)%p;
	    lazy[o]=0;
    }
}
void upd(int o,int l,int r,int nl,int nr,int v)
{
	if(nl<=l&&r<=nr)
	{
		sum[o]=(sum[o]+(r-l+1)*v%p)%p;lazy[o]=(lazy[o]+v)%p;return;
	}
	push_down(o,l,r);
	int mid=(l+r)>>1;
	if(nl<=mid)upd(lc,l,mid,nl,nr,v);
	if(nr>mid)upd(rc,mid+1,r,nl,nr,v);
	sum[o]=(sum[lc]+sum[rc])%p;
}
void updm(int o,int l,int r,int nl,int nr,int v)
{
	if(nl<=l&&r<=nr)
	{
		sum[o]=sum[o]*v%p;lm[o]=lm[o]*v%p;lazy[o]=lazy[o]*v%p;return;
	}
	push_down(o,l,r);
	int mid=(l+r)>>1;
	if(nl<=mid)updm(lc,l,mid,nl,nr,v);
	if(nr>mid)updm(rc,mid+1,r,nl,nr,v);
	sum[o]=(sum[lc]+sum[rc])%p;
}
ll que(int o,int l,int r,int nl,int nr)
{
	if(nl<=l&&r<=nr)return sum[o]%p;
	push_down(o,l,r);
	int mid=(l+r)>>1;ll ans=0;
	if(nl<=mid)ans=(ans+que(lc,l,mid,nl,nr))%p;
	if(nr>mid)ans=(ans+que(rc,mid+1,r,nl,nr))%p;
	return ans%p;
}
int main()
{
	//freopen("in.txt","r",stdin);
    scanf("%d%d%d",&n,&m,&p);
    for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
    build(1,1,n);
    while(m--)
    {
    	int op,x,y,k;
    	scanf("%d%d%d",&op,&x,&y);
    	if(op==1)scanf("%d",&k),updm(1,1,n,x,y,k);
    	else if(op==2)scanf("%d",&k),upd(1,1,n,x,y,k);
	    else printf("%lld\n",que(1,1,n,x,y)%p);
	}
	return 0;
}