#include <iostream>
#include <vector>

using namespace std;

const int N = 1e5 + 5;

int A[N], P[N], P_map[N];
vector<int> segTree(4 * N);

void build(int node, int start, int end) {
    // ... (same as before)
}

void update(int node, int start, int end, int idx, int val) {
    // ... (same as before)
}

int query(int node, int start, int end, int l, int r) {
    // ... (same as before)
}

int main() {
    int N, Q;
    cin >> N >> Q;
    for (int i = 1; i <= N; i++) {
        cin >> P[i];
        P_map[P[i]] = i;
    }

    // Build the Segment Tree
    build(1, 1, N);

    while (Q--) {
        int type;
        cin >> type;

        if (type == 0 || type == 1) {
            int l, r, c;
            cin >> l >> r >> c;

            if (type == 0) {
                // Update the range [l, r] in A
                for (int i = l; i <= r; i++) {
                    update(1, 1, N, i, c);
                }
            } else {
                // Update the range [P[l], P[r]] in A
                for (int i = l; i <= r; i++) {
                    update(1, 1, N, P_map[i], c);
                }
            }
        } else if (type == 2 || type == 3) {
            int l, r;
            cin >> l >> r;

            if (type == 2) {
                // Query the sum of the range [l, r] in A
                cout << query(1, 1, N, l, r) << endl;
            } else {
                // Query the sum of the range [P[l], P[r]] in A
                int sum = 0;
                for (int i = l; i <= r; i++) {
                    sum += query(1, 1, N, P_map[i], P_map[i]);
                }
                cout << sum << endl;
            }
        }
    }

    return 0;
}