【无标题】

 

 

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
#define endl '\n'
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll n, m, mod;
ll a[N];
struct node
{
	int l, r;
	ll add, mul;	//懒惰标记
	ll sum;
} tree[N << 2];

void pushup(int p)
{
	tree[p].sum = (tree[p << 1].sum + tree[p << 1 | 1].sum) % mod;
}

void pushdown(int p)	//一个pushdown完成所有
{
	int l = tree[p].l, r = tree[p].r;
	int mid = (l + r) >> 1;

	tree[p << 1].add = (tree[p << 1].add * tree[p].mul + tree[p].add) % mod;	//对add标记进标记，值得注意的是要把下面节点的add先乘当前节点的mul标记
	tree[p << 1 | 1].add = (tree[p << 1 | 1].add * tree[p].mul + tree[p].add) % mod;

	tree[p << 1].mul = tree[p << 1].mul * tree[p].mul % mod;
	tree[p << 1 | 1].mul = tree[p << 1 | 1].mul * tree[p].mul % mod;

	tree[p << 1].sum = (tree[p << 1].sum * tree[p].mul + (mid - l + 1) * tree[p].add) % mod;	//基本的数学运算法则
	tree[p << 1 | 1].sum = (tree[p << 1 | 1].sum * tree[p].mul + (r - mid) * tree[p].add) % mod;

	tree[p].add = 0;
	tree[p].mul = 1;

	return ;
}

void build(int p, int l, int r)
{
	tree[p].l = l, tree[p].r = r;
	tree[p].mul = 1;
	if (l == r)
	{
		tree[p].sum = a[l] % mod;
		return ;
	}
	int mid = (l + r) >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	pushup(p);
}

void update_mul(int p, int x, int y, int k)
{
	int l = tree[p].l, r = tree[p].r;
	if (x <= l && r <= y)
	{
		tree[p].add = tree[p].add * k % mod;	//更新add标记，因为是整体乘
		tree[p].mul = tree[p].mul * k % mod;
		tree[p].sum = tree[p].sum * k % mod;
		return ;
	}
	pushdown(p);
	int mid = (l + r) >> 1;
	if (x <= mid)
		update_mul(p << 1, x, y, k);
	if (y >= mid + 1)
		update_mul(p << 1 | 1, x, y, k);
	pushup(p);
}

void update_add(int p, int x, int y, int k)
{
	int l = tree[p].l, r = tree[p].r;
	if (x <= l && r <= y)
	{
		tree[p].add = (tree[p].add + k) % mod;
		tree[p].sum = (tree[p].sum + (r - l + 1) * k) % mod;
		return ;
	}
	pushdown(p);
	int mid = (l + r) >> 1;
	if (x <= mid)
		update_add(p << 1, x, y, k);
	if (y >= mid + 1)
		update_add(p << 1 | 1, x, y, k);
	pushup(p);
}

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

int main()
{
	IOS; cin.tie(0), cout.tie(0);
	cin >> n >> m >> mod;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	build(1, 1, n);

	for (int i = 1; i <= m; ++i)
	{
		int op, x, y, k;
		cin >> op;
		if (op == 1)
		{
			cin >> x >> y >> k;
			update_mul(1, x, y, k);
		}
		else if (op == 2)
		{
			cin >> x >> y >> k;
			update_add(1, x, y, k);
		}
		else
		{
			cin >> x >> y;
			cout << query(1, x, y) % mod << endl;
		}
	}
	return 0;
}