#include <iostream>
#include <cstring>
#define lc (o << 1)
#define rc (o << 1 | 1)
typedef long long LL;
using namespace std;
#define S (1e5 + 5)
long long sum[400005], atag[400005], mtag[400005];
long long a[100005];
int n, q, m;
void pushup(int o) {
	sum[o] = (sum[lc] + sum[rc]) % m;
}
void pushdown(int o, int l, int r) {
	atag[lc] = ((mtag[o] * atag[lc]) % m + atag[o]) % m;
	atag[rc] = ((mtag[o] * atag[rc]) % m + atag[o]) % m;
	mtag[lc] = (mtag[lc] * mtag[o]) % m;
	mtag[rc] = (mtag[rc] * mtag[o]) % m;
	int mid = (l + r) / 2;
	sum[lc] = ((sum[lc] * mtag[o]) % m + ((mid - l + 1) * atag[o]) % m) % m;
	sum[rc] = ((sum[rc] * mtag[o]) % m + ((r - mid) * atag[o]) % m) % m;
	atag[o] = 0;
	mtag[o] = 1;
}
void build(int o, int l, int r) {
	if (l == r) {
		sum[o] = a[l] % m;
		return;
	}
	int mid = (l + r) / 2;
	build(lc, l, mid);
	build(rc, mid + 1, r);
	pushup(o);
}
LL query(int o, int l, int r, int ql, int qr) {
	if (ql <= l && r <= qr) {
		return sum[o] % m;
	}
	LL mid = (l + r) / 2, ans = 0;
	pushdown(o, l, r);
	if (ql <= mid) {
		ans = (ans + query(lc, l, mid, ql, qr)) % m;
	}
	if (mid < qr) {
		ans = (ans + query(rc, mid + 1, r, ql, qr)) % m;
	}
	return ans;
}
void mupdate(int o, int l, int r, int pl, int pr, long long v) {
	if (pl <= l && r <= pr) {
		mtag[o] = (mtag[o] * v) % m;
		atag[o] = (atag[o] * v) % m;
		sum[o] = (sum[o] * v) % m;
		return;
	}
	pushdown(o, l, r);
	int mid = (l + r) / 2;
	if (pl <= mid) {
		mupdate(lc, l, mid, pl, pr, v);
	}
	if (mid < pr) {
		mupdate(rc, mid + 1, r, pl, pr, v);
	}
	pushup(o);
}
void aupdate(int o, int l, int r, int pl, int pr, long long v) {
	if (pl <= l && r <= pr) {
		sum[o] = (sum[o] + ((r - l + 1) * v) % m) % m;
		atag[o] = (atag[o] + v) % m;
		return;
	}
	pushdown(o, l, r);
	int mid = (l + r) / 2;
	if (pl <= mid) {
		aupdate(lc, l, mid, pl, pr, v);
	}
	if (mid < pr) {
		aupdate(rc, mid + 1, r, pl, pr, v);
	}
	pushup(o);
}
int main() {
	memset(mtag, 1, sizeof(mtag));
	memset(atag, 0, sizeof(atag));
	cin >> n >> q >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	build(1, 1, n);
	LL op, x, y, k;
	while (q--) {
		cin >> op;
		if (op == 1) {
			cin >> x >> y >> k;
			mupdate(1, 1, n, x, y, k);
		} else if (op == 2) {
			cin >> x >> y >> k;
			aupdate(1, 1, n, x, y, k);
		} else {
			cin >> x >> y;
			cout << query(1, 1, n, x, y) << endl;
		}
	}
	return 0;
}