#include <cstdio>
using namespace std;
struct {
    int l;
    int r;
    long long val;
    long long lazy;
    long long mul;
}tree[401000];
long long nums[401000];
int mod;
void push_down(int u) {
    tree[u << 1].val = (tree[u << 1].val * tree[u].mul + (tree[u << 1].r - tree[u << 1].l + 1) * tree[u].lazy) % mod;
    tree[u << 1 | 1].val = (tree[u << 1 | 1].val * tree[u].mul + (tree[u << 1 | 1].r - tree[u << 1 | 1].l + 1) * tree[u].lazy) % mod;
    tree[u << 1].lazy = (tree[u].lazy + tree[u << 1].lazy) % mod;
    tree[u << 1 | 1].lazy = (tree[u].lazy + tree[u << 1 | 1].lazy) % mod;
    tree[u << 1].mul = (tree[u << 1].mul * tree[u].mul) % mod;
    tree[u << 1 | 1].mul = (tree[u << 1 | 1].mul * tree[u].mul) % mod;
    tree[u].lazy = 0;
    tree[u].mul = 1;
}
void buildTree(int l, int r, int u)
{
    tree[u].mul = 1;
    tree[u].lazy = 0;
    tree[u].l = l;
    tree[u].r = r;
    if (l == r) {
        tree[u].val = nums[l] % mod;
        return;
    }
    int mid = l + ((r - l) >> 1);
    buildTree(l, mid, u << 1);
    buildTree(mid + 1, r, u << 1 | 1);
    tree[u].val = (tree[u << 1].val + tree[u << 1 | 1].val) % mod;
}
void update_add(int l, int r, long long k, int u = 1) {
    if (tree[u].l > r || tree[u].r < l)
        return;
    if (tree[u].l >= l && tree[u].r <= r) {
        tree[u].val = (tree[u].val + (tree[u].r - tree[u].l + 1) * k) % mod;

        tree[u].lazy = (k + tree[u].lazy) % mod;

        return;
    }
    push_down(u);
    int mid = (tree[u].l + tree[u].r) >> 1;
    if (l <= mid) {
        update_add(l, r, k, u << 1);
    }
    if (r > mid) {
        update_add(l, r, k, u << 1 | 1);
    }
    tree[u].val = (tree[u << 1].val + tree[u << 1 | 1].val) % mod;
}
void update_mul(int l, int r, long long k, int u = 1) {
    if (tree[u].l > r || tree[u].r < l)
        return;
    if (tree[u].l >= l && tree[u].r <= r) {
        tree[u].val = k * tree[u].val % mod;
        tree[u].mul = k * tree[u].mul % mod;
        return;
    }
    push_down(u);
    int mid = (tree[u].l + tree[u].r) >> 1;
    if (l <= mid) {
        update_mul(l, r, k, u << 1);
    }
    if (r > mid) {
        update_mul(l, r, k, u << 1 | 1);
    }
    tree[u].val = (tree[u << 1].val + tree[u << 1 | 1].val) % mod;
}
long long query(int l, int r, int u = 1) {
    if (tree[u].l > r || tree[u].r < l)
        return 0;
    if (tree[u].l >= l && tree[u].r <= r)
        return tree[u].val;
    push_down(u);
    long long ans = 0;
    int mid = (tree[u].l + tree[u].r) >> 1;
    if (l <= mid)
        ans += query(l, r, u << 1);
    if (r > mid)
        ans += query(l, r, u << 1 | 1);
    return ans;
}
int main()
{
    int n, m;
    scanf("%d %d %d", &n, &m, &mod);
    for (int i = 1; i <= n; i++)
        scanf("%lld", &nums[i]);
    buildTree(1, n, 1);
    while(m--) {
        int s;
        scanf("%d", &s);
        if (s == 1) {
            int x, y, k;
            scanf("%d%d%d", &x, &y, &k);
            update_mul(x, y, k);
        } else if (s == 3) {
            int x, y;
            scanf("%d%d", &x, &y);
            long long ans = query(x, y);
            printf("%lld\n",ans % mod);
        } else if (s == 2) {
            int x, y, k;
            scanf("%d%d%d", &x, &y, &k);
            update_add(x, y, k);
        }
    }
    return 0;
}