RT，code:

#include <bits/stdc++.h>
using namespace std;

inline long long read() {
	long long num = 0;  char ch = getchar();
	while (!isdigit(ch)) { if (ch=='-') ch = getchar(); }
	while (isdigit(ch)) { num = (num<<1)+(num<<3)+(ch^48); ch = getchar(); }
	return num;
}

inline void print(const long long& x) {
	if (x<0) {putchar('-');}
	if(x<10) putchar(x+48);
	else {print(x/10); putchar(x%10+'0'); }
}

long long n, m, mod;
long long times[114514 << 2];
long long tree[114514 << 2];
long long a[114514 << 2];
long long add[114514 << 2];

void build(int k, int l, int r)
{
	times[k] = 1;
	
	if (l==r) {
		tree[k] = a[l];
		return ;
	}
	
	int mid = l + r >> 1;
	build(k << 1, l , mid);
	build(k << 1 | 1, mid + 1, r);
	tree[k] = tree[k<<1] + tree[k<<1 | 1];
	return ;
}

void Add(int k, int l, int r, int v)
{
	add[k] += v;                           add[k]  %= mod;
	tree[k] += (r-l+1) * (long long) v;    tree[k] %= mod;
	return ;
}


void Times(int k, int l, int r, int v)
{
	times[k] *= v;  times[k] %= mod;
	tree[k] *= v;   tree[k]  %= mod;
	add[k] *= v;    add[k]   %= mod;
	return ;
}

void pushdown(int k, int l, int r, int mid)
{
	if(times[k]) 
	{
		Times(k<<1, l, mid, times[k]);
		Times(k << 1 | 1, mid+1, r, times[k]);
		times[k] = 1;
	}
	
	if (add[k])
	{
		Add(k << 1, l, mid, add[k]);
		Add(k << 1 | 1, mid + 1, r, add[k]);
		add[k] = 0;
	}
	
	return ;
}


void modify_add(int k, int l, int r, int x, int y, int v)
{
	if (x <= l && r <= y)
	{
		Add(k, l, r, v);
		return ;
	}
	
	if (l > y || r < x) return ;
	
	int mid = l + r >> 1;
	pushdown(k, l, r, mid);
	
	modify_add(k<<1, l, mid, x, y, v);
	modify_add(k << 1 | 1, mid + 1, r, x, y, v);
	tree[k] = (tree[k<<1]%mod + tree[k<<1 | 1]%mod) % mod;
	
	return ;
}


void modify_times(int k, int l, int r, int x, int y, int v)
{
	if (x <= l && r <= y)
	{
		Times(k, l, r, v);
		return ;
	}
	
	if (l > y || r < x)  return ;
	
	int mid = l + r >> 1;
	pushdown(k, l, r, mid);
	
	modify_times(k << 1, l, mid, x, y, v);
	modify_times(k <<1 | 1, mid + 1, r, x, y, v);
	tree[k] = (tree[k<<1]%mod + tree[k<<1 | 1]%mod) % mod;
	return ;
}



long long query(int k, int l, int r, int x, int y)
{
	if (x <= l && r <= y)
		return tree[k]%mod;
	
	if (l > y || r < x) return 0;
	
	int mid = l + r >> 1;
	pushdown(k, l, r, mid);
	
	return (query(k << 1, l, mid, x, y)%mod + query(k << 1 | 1, mid + 1, r, x, y)%mod) % mod;
}



int main()
{
	n = read(), m = read(), mod = read();
	for (int i = 1; i <= n; i ++)
		a[i] = read();
	build(1, 1, n);
	
	// puts("ohhhhhhhhh");
	
	for (int i = 1; i <= m; i ++)
	{
		int op = read(), x = read(), y = read();
		if (op == 1) {
			modify_times(1, 1, n, x, y, read());
		} else {
			if (op == 2) {
				modify_add(1, 1, n, x, y, read());
			} else {
				print(query(1, 1, n, x, y));
				putchar('\n');
			}
		}
	}
	return 0;
}

感谢大佬，赏一个贴贴（