#include<bits/stdc++.h>
#define int long long 
#define cal int mid = (l + r) / 2,lchild = root * 2,rchild = root * 2 + 1;
#define upd tree[root].val = (tree[lchild].val + tree[rchild].val) % m;
#define adding tree[lchild].val += tree[root].add % m * (mid - l + 1) % m;tree[rchild].val += tree[root].add % m * (r - mid) % m;tree[lchild].add += tree[root].add % m;tree[rchild].add += tree[root].add % m;tree[root].add = 0;
#define multiply tree[lchild].val *= quick_pow(tree[root].times,mid - l + 1,m);tree[rchild].val *= quick_pow(tree[root].times,r - mid,m);tree[lchild].times *= tree[root].times;tree[rchild].times *= tree[root].times;tree[root].times = 1;
using namespace std;
const int N = 1e6 + 9,ROOT = 1;
int a[N];
int m;
struct node {
	int val,add,times = 1;
} tree[N];
int quick_pow(int x,int y,int mod){
	int ans = 1;
	while(y){
		if(y & 1)
			ans = ans * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return ans;
}
void build(int l,int r,int root) {
	if(l == r) {
		tree[root].val = a[l] % m;
		return;
	}
	cal
	build(l,mid,lchild);
	build(mid + 1,r,rchild);
	upd
}
void add_update(int s,int t,int l,int r,int root,int add) {
	if(s <= l && r <= t) {
		tree[root].val += (r - l + 1) % m * add % m;
		tree[root].add += add % m;
		return;
	}
	cal
	if(tree[root].add != 0 && l != r) {
		adding
	}
	if(s <= mid)
		add_update(s,t,l,mid,lchild,add);
	if(t > mid)
		add_update(s,t,mid + 1,r,rchild,add);
	upd
}
void multi_update(int s,int t,int l,int r,int root,int times){
	if(s <= l && r <= t) {
		tree[root].val *= quick_pow(times,r - l + 1,m);
		tree[root].times *= times;
		return;
	}
	cal
	if(tree[root].times != 1 && l != r) {
		multiply
	}
	if(s <= mid)
		multi_update(s,t,l,mid,lchild,times);
	if(t > mid)
		multi_update(s,t,mid + 1,r,rchild,times);
	upd
}
int getsum(int s, int t, int l, int r, int root) {
	if(s <= l && r <= t)
		return tree[root].val % m;
	cal
	if(tree[root].add != 0) {
		adding
	}
	if(tree[root].times != 1) {
		multiply
	}
	int sum = 0;
	if(s <= mid)
		sum = (sum + getsum(s,t,l,mid,lchild)) % m;
	if(t > mid)
		sum = (sum + getsum(s,t,mid + 1,r,rchild)) % m;
	return sum % m;
}
int n,q;
int op,x,y,k;
signed main() {
	scanf("%lld%lld%lld", &n, &q, &m);
	for(int i = 1; i <= n; i++){
		scanf("%lld", &a[i]);
		a[i] %= m;
	}
	build(1,n,ROOT);
	for(int i = 1; i <= q; i++) {
		scanf("%lld%lld%lld", &op, &x, &y);
		if(op == 1) {
			scanf("%lld" ,&k);
			multi_update(x,y,1,n,ROOT,k % m);
		}
		else if(op == 2){
			scanf("%lld", &k);
			add_update(x,y,1,n,ROOT,k % m);
		}
		else{
			printf("%lld\n", getsum(x,y,1,n,ROOT) % m);
		}
	}
}