#include <iostream>
using namespace std;

const int MAX_N = 1000000;
int MOD;

long long arr[MAX_N + 1];
long long seg[4 * MAX_N];
long long lazy_mul[4 * MAX_N];
long long lazy_add[4 * MAX_N];

void build(int p, int l, int r) {
    if (l == r) {
        seg[p] = arr[l];
        return;
    }
    int mid = (l + r) / 2;
    build(2 * p, l, mid);
    build(2 * p + 1, mid + 1, r);
    seg[p] = (seg[2 * p] + seg[2 * p + 1]) % MOD;
}

void pushdown(int p, int l, int r) {
    int mid = (l + r) / 2;
    seg[2 * p] = (seg[2 * p] * lazy_mul[p]) % MOD;
    seg[2 * p] = (seg[2 * p] + lazy_add[p] * (mid - l + 1)) % MOD;
    seg[2 * p + 1] = (seg[2 * p + 1] * lazy_mul[p]) % MOD;
    seg[2 * p + 1] = (seg[2 * p + 1] + lazy_add[p] * (r - mid)) % MOD;
    lazy_mul[2 * p] = (lazy_mul[2 * p] * lazy_mul[p]) % MOD;
    lazy_mul[2 * p + 1] = (lazy_mul[2 * p + 1] * lazy_mul[p]) % MOD;
    lazy_add[2 * p] = (lazy_add[2 * p] + lazy_add[p]) % MOD;
    lazy_add[2 * p + 1] = (lazy_add[2 * p + 1] + lazy_add[p]) % MOD;
    lazy_mul[p] = 1;
    lazy_add[p] = 0;
    return;
}

void update_mul(int nl, int nr, int p, int l, int r, long long k) {
    if (nl <= l && r <= nr) {
        seg[p] = (seg[p] * k) % MOD;
        lazy_mul[p] = (lazy_mul[p] * k) % MOD;
        lazy_add[p] = (lazy_add[p] * k) % MOD;
        return;
    }
    pushdown(p, l, r);
    int mid = (l + r) / 2;
    if (nl <= mid) update_mul(nl, nr, 2 * p, l, mid, k);
    if (nr > mid) update_mul(nl, nr, 2 * p + 1, mid + 1, r, k);
    seg[p] = (seg[2 * p] + seg[2 * p + 1]) % MOD;
}

void update_add(int nl, int nr, int p, int l, int r, long long k) {
    if (nl <= l && r <= nr) {
        seg[p] = (seg[p] + k * (r - l + 1)) % MOD;
        lazy_add[p] = (lazy_add[p] + k) % MOD;
        return;
    }
    pushdown(p, l, r);
    int mid = (l + r) / 2;
    if (nl <= mid) update_add(nl, nr, 2 * p, l, mid, k);
    if (nr > mid) update_add(nl, nr, 2 * p + 1, mid + 1, r, k);
    seg[p] = (seg[2 * p] + seg[2 * p + 1]) % MOD;
}

long long query(int ql, int qr, int p, int l, int r) {
    if (ql <= l && r <= qr) {
        return seg[p];
    }
    pushdown(p, l, r);
    int mid = (l + r) / 2;
    long long res = 0;
    if (ql <= mid) res = (res + query(ql, qr, 2 * p, l, mid)) % MOD;
    if (qr > mid) res = (res + query(ql, qr, 2 * p + 1, mid + 1, r)) % MOD;
    return res;
}

int main() {
    int n, m;
    cin >> n >> m >> MOD;

    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
    }

    build(1, 1, n);

    while (m--) {
        int op, x, y;
        long long k;
        cin >> op >> x >> y;
        if (op == 1) {
            cin >> k;
            update_mul(x, y, 1, 1, n, k);
        } else if (op == 2) {
            cin >> k;
            update_add(x, y, 1, 1, n, k);
        } else {
            cout << query(x, y, 1, 1, n) << endl;
        }
    }

    return 0;
}