只AC了1、3、4点，其他都WA了，求大佬帮帮忙！

#include <bits/stdc++.h>
using namespace std;
int n,q,m;
int a[100010];
class T {
	public :
	int l,r,lazy1,lazy2;
	long long ans;
}tree[800010];
inline void spread (int i)
{
	tree[i<<1].ans=(((tree[i<<1].ans*tree[i].lazy2)%m)+tree[i].lazy1*(tree[i<<1].r-tree[i<<1].l+1))%m;
	tree[i<<1|1].ans=(((tree[i<<1|1].ans*tree[i].lazy2)%m)+tree[i].lazy1*(tree[i<<1|1].r-tree[i<<1|1].l+1))%m;
	tree[i<<1].lazy2*=tree[i].lazy2; tree[i<<1].lazy2%=m;
	tree[i<<1|1].lazy2*=tree[i].lazy2; tree[i<<1].lazy2%=m;
	tree[i<<1].lazy1*=tree[i].lazy2; tree[i<<1].lazy1+=tree[i].lazy1; tree[i<<1].lazy1%=m;
	tree[i<<1|1].lazy1*=tree[i].lazy2; tree[i<<1|1].lazy1+=tree[i].lazy1; tree[i<<1].lazy1%=m;
	tree[i].lazy1=0; tree[i].lazy2=1;
}
void makeTree (int i,int l,int r)
{
	tree[i].l=l; tree[i].r=r; tree[i].lazy2=1;   // lazy2是累乘器啊喂！ 
	if (l==r) {
		tree[i].ans=a[l];
		return ;
	}
	int mid=(l+r)>>1;
	makeTree(i<<1,l,mid);
	makeTree(i<<1|1,mid+1,r);
	tree[i].ans=tree[i<<1].ans+tree[i<<1|1].ans;
	tree[i].ans%=m;
}
void addTree (int i,int l,int r,int k)
{
	if (tree[i].l>=l && tree[i].r<=r) {
		tree[i].ans+=(tree[i].r-tree[i].l+1)*k;
		tree[i].ans%=m;
		tree[i].lazy1+=k;
		return ;
	}
	spread(i);
	if (tree[i<<1].r>=l) addTree(i<<1,l,r,k);
	if (tree[i<<1|1].l<=r) addTree(i<<1|1,l,r,k);
	tree[i].ans=tree[i<<1].ans+tree[i<<1|1].ans;
	tree[i].ans%=m;
}
void mulTree (int i,int l,int r,int k)
{
	if (tree[i].l>=l && tree[i].r<=r) {
		tree[i].ans=(tree[i].ans*k)%m;
		tree[i].lazy2*=k;                   // 累乘器！不是累加！ 
		tree[i].lazy1*=k; tree[i].lazy1%=m; // 相当关键！！！ 
		return ;
	}
	spread(i);
	if (tree[i<<1].r>=l) mulTree(i<<1,l,r,k);
	if (tree[i<<1|1].l<=r) mulTree(i<<1|1,l,r,k);
	tree[i].ans=tree[i<<1].ans+tree[i<<1|1].ans;
	tree[i].ans%=m;
}
long long searchTree (int i,int l,int r)
{
	if (tree[i].l>=l && tree[i].r<=r) return tree[i].ans;
	long long sum=0;
	spread(i);
	if (tree[i<<1].r>=l) sum+=searchTree(i<<1,l,r);
	if (tree[i<<1|1].l<=r) sum+=searchTree(i<<1|1,l,r);
	sum%=m;
	return sum;
}
int main()
{	
	scanf("%d%d%d",&n,&q,&m);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	makeTree(1,1,n);
	for (int i=1;i<=q;i++) {
		int f;
		scanf("%d",&f);
		if (f==1) {
			int x,y,k;
			scanf("%d%d%d",&x,&y,&k);
			mulTree(1,x,y,k);
		}
		if (f==2) {
			int x,y,k;
			scanf("%d%d%d",&x,&y,&k);
			addTree(1,x,y,k);
		}
		if (f==3) {
			int x,y;
			scanf("%d%d",&x,&y);
			printf("%lld\n",searchTree(1,x,y));
			continue;
		}
//		for (int i=1;i<=2*n-1;i++)
//			cout<<tree[i].ans<<" ";
//		cout<<endl;
//		for (int i=1;i<=2*n-1;i++)
//			cout<<tree[i].lazy1<<" ";
//		cout<<endl;
//		for (int i=1;i<=2*n-1;i++)
//			cout<<tree[i].lazy2<<" ";
//		cout<<endl;
	}
	return 0;
}
/*
5 10 100
5 4 6 2 3
2 1 3 3
2 1 5 2
1 1 3 2
1 1 5 2
2 1 3 4
3 1 3
3 1 2
3 4 5
1 1 5 3
3 1 5
*/
/*
5 8 100
5 4 6 2 3
1 1 3 0
3 3 3
2 1 3 1
3 1 2
1 1 5 0
3 5 5
2 1 4 1
3 1 1
*/