码风良好（分模块编写）0pts求调

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <vector>
#include <queue>
#define int long long
 
using namespace std;

inline int read();
void write(int);
void writeln(int);

const int N  = 100005;
int n, m, a[N], mod;

int w[N * 4], lzy_add[N * 4], lzy_mul[N * 4];
void pushup(int u) {
	w[u] = (w[u << 1] + w[u << 1 | 1]) % mod;
}
void build(int u, int l, int r) {
	lzy_mul[u] = 1;
	if(l == r) w[u] = a[l];
	else {
		int mid = (l + r) >> 1;
		build(u << 1, l, mid);
		build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}
}
bool in(int L, int R, int l, int r) {
	return (L >= l) && (R <= r);
}
bool out(int L, int R, int l, int r) {
	return (L > r) || (R < l);
}
void maketag(int u, int len, int x, int type) {
	if(type == 1) {
		lzy_mul[u] = (lzy_mul[u] * x) % mod;
		lzy_add[u] = (lzy_add[u] * x) % mod;
		w[u] = (w[u] * x) % mod;
	}
	else {
		lzy_add[u] = (lzy_add[u] + x) % mod;
		w[u] = (w[u] + len * x) % mod;
	}
}
void pushdown(int u, int L, int R) {
	int mid = (L + R) >> 1;
	maketag(u << 1, mid - L + 1, lzy_add[u], 2);
	maketag(u << 1 | 1, R - mid, lzy_add[u], 2);
	maketag(u << 1, mid - L + 1, lzy_mul[u], 1);
	maketag(u << 1 | 1, R - mid, lzy_mul[u], 1);
	lzy_add[u] = 0;
	lzy_mul[u] = 1;
}

void update(int u, int L, int R, int l, int r, int p, int type) {
	if(in(L, R, l, r)) maketag(u, R - L + 1, p, type);
	else if(!out(L, R, l, r)) {
		pushdown(u, L, R);
		int mid = (L + R) >> 1;
		update(u << 1, L, mid, l, r, p, type);
		update(u << 1 | 1, mid + 1, R, l, r, p, type);
		pushup(u);
	}		
}
int query(int u, int L, int R, int l, int r) {
	if(in(L, R, l, r)) return w[u] % mod;
	else if(!out(L, R, l, r)) {
		pushdown(u, L, R);
		int mid = (L + R) >> 1;
		return (query(u << 1, L, mid, l, r) + query(u << 1 | 1, mid + 1, R, l, r)) % mod;
	} else return 0;
}
 
signed main() {

//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);

	n = read();
	m = read();
	mod = read();
	for(int i = 1; i <= n; i++) a[i] = read();
	
	build(1, 1, n);
	while(m--) {
		int op = read();
		if(op == 1) {
			int x = read(), y = read(), k = read();
			update(1, 1, n, x, y, k, 1);
		}
		if(op == 2) {
			int x = read(), y = read(), k = read();
			update(1, 1, n, x, y, k, 2); 
		}
		if(op == 3) {
			int x = read(), y = read();
			writeln(query(1, 1, n, x, y));
		}
	}
//	printf("\n");
//	cout<<"The time used: ";
//	printf("%.2lfs",(double)clock()/CLOCKS_PER_SEC);

	return 0;

}

inline int read() {
	int res = 0, f = 1;
	char ch = getchar();
	while( !(ch >= '0' && ch <= '9') ) {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		res = (res << 1) + (res << 3) + (ch ^ 48);
		ch = getchar();
	}
	return res * f;
}

void write(int x) {
	static int sta[35];
	int top = 0;
	do {
		sta[top++] = x % 10;
		x /= 10;
	} while(x);
	while(top) putchar(sta[--top] ^ 48);
}

void writeln(int x) {
	write(x);
	putchar('\n');
}