#include <bits/stdc++.h>
using namespace std; 
const int N = 100005;
int n, m, p, a[N];
struct node {
	int l, r;
	int sum, add, mul; //add:加法的lazytag,mul:乘法的lazytag
	#define l(p) t[p].l
	#define r(p) t[p].r
	#define sum(p) t[p].sum
	#define add(p) t[p].add
	#define mul(p) t[p].mul
} t[N*4]; 

void build(int p, int l, int r) {
	mul(p) = 1, l(p) = l, r(p) = r;
	if (l == r) {
		sum(p) = a[l] % p;
		return;
	}
	int mid = l + r >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	sum(p) = (sum(p << 1) + sum(p << 1 | 1)) % p;
//	printf("%d %d %d\n", sum(p), l(p), r(p));
}

void spread(int p) {
	mul(p << 1) = (mul(p << 1) * mul(p)) % p;
	add(p << 1) = (add(p) + mul(p) * add(p << 1)) % p;
	sum(p << 1) = (sum(p << 1) * mul(p) % p + add(p) * (r(p << 1) - l(p << 1) + 1) % p) % p;
	
	mul(p << 1 | 1) = (mul(p << 1 | 1) * mul(p)) % p;
	add(p << 1 | 1) = (add(p) + mul(p) * add(p << 1 | 1)) % p;
	sum(p << 1 | 1) = (sum(p << 1 | 1) * mul(p) % p + add(p) * (r(p << 1 | 1) - l(p << 1 | 1) + 1) % p) % p;
	
	add(p) = 0, mul(p) = 1;
}

void ChangeMul(int p, int l, int r, int k) {
	if (l <= l(p) && r(p) <= r) {
		mul(p) = (mul(p) * k) % p;
		add(p) = (add(p) * k) % p;
		sum(p) = (sum(p) * k) % p;
		return;
	}
	spread(p);
	int mid = l(p) + r(p) >> 1;
	if (l <= mid) ChangeMul(p << 1, l, r, k);
	if (r > mid) ChangeMul(p << 1 | 1, l, r, k);
	sum(p) = (sum(p << 1) + sum(p << 1 | 1)) % p;
}

void ChangeAdd(int p, int l, int r, int k) {
	if (l <= l(p) && r(p) <= r) {
		add(p) = (add(p) + k) % p;
		sum(p) = (sum(p) + k * (r(p) - l(p) + 1) % p) % p;
		return;
	}
	spread(p);
	int mid = l(p) + r(p) >> 1;
	if (l <= mid) ChangeAdd(p << 1, l, r, k);
	if (r > mid) ChangeAdd(p << 1 | 1, l, r, k);
	sum(p) = (sum(p << 1) + sum(p << 1 | 1)) % p;
}

int query(int p, int l, int r) {
	if (l <= l(p) && r(p) <= r) return sum(p);	
	spread(p);
	int mid = l(p) + r(p) >> 1;
	int ans = 0;
	if (l <= mid) ans = (ans + query(p << 1, l, r)) % p;
	if (r > mid) ans = (ans + query(p << 1 | 1, l, r)) % p;
	return ans;
}

int main() {
	scanf("%d%d%d", &n, &m, &p);
	for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	build(1, 1, n);
//	printf("%d\n", query(1, 1, 1));
	while (m--) {
		int op; scanf("%d", &op);
		if (op == 1) {
			int l, r, k; scanf("%d%d%d", &l, &r, &k);
			ChangeMul(1, l, r, k);
		}
		else if (op == 2) {
			int l, r, k; scanf("%d%d%d", &l, &r, &k);
			ChangeAdd(1, l, r, k);
		}
		else {
			int l, r; scanf("%d%d", &l, &r);
			printf("%d\n", query(1, l, r));
		}
	}
	return 0;
}