D

#include <iostream>
#define int long long
using namespace std;

const int N = 2e5 + 5;

struct node {
    int sum, p;
};

int n, q, a[N];
node t[4*N];

void build(int v, int vl, int vr) {
    if (vl == vr) {
        t[v].sum = a[vl];
        t[v].p = a[vl];
        return;
    }
    int vm = (vl + vr) / 2;
    build(2 * v, vl, vm);
    build(2 * v + 1, vm + 1, vr);

    t[v].sum = t[2 * v].sum + t[2 * v + 1].sum;
    t[v].p = 0;///no promise
}

void push(int v, int vl, int vr) {
    if (t[v].p == 0)
        return;
    int vm = (vl + vr) / 2;

    t[2 * v].p = t[v].p;
    t[2 * v + 1].p = t[v].p;

    t[2 * v].sum = (vm - vl + 1) * t[v].p;
    t[2 * v + 1].sum = (vr - vm) * t[v].p;

    t[v].p = 0;
}

void update(int v, int vl, int vr, int l, int r, int x) {
    //cout << v << ' ' << vl << ' ' << vr << ' ' << l << ' ' << r << endl;
    if (vl == l && vr == r) {
        t[v].p = x;
        t[v].sum = x * (r - l + 1);
        return;
    }
    int vm = (vl + vr) / 2;
    push(v, vl, vr);
    if (r <= vm)
        update(2 * v, vl, vm, l, r, x);
    else if (l > vm)
        update(2 * v + 1, vm + 1, vr, l, r, x);
    else {
        update(2 * v, vl, vm, l, vm, x);
        update(2 * v + 1, vm + 1, vr, vm + 1, r, x);
    }
    t[v].sum = t[2 * v].sum + t[2 * v + 1].sum;
}

int get(int v, int vl, int vr, int l, int r) {
    if (vl == l && vr == r)
        return t[v].sum;
    int vm = (vl + vr) / 2;
    push(v, vl, vr);
    if (r <= vm)
        return get(2 * v, vl, vm, l, r);
    else if (l > vm)
        return get(2 * v + 1, vm + 1, vr, l, r);
    else {
        return get(2 * v, vl, vm, l, vm) + get(2 * v + 1, vm + 1, vr, vm + 1, r);
    }

}

signed main()
{
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    build(1, 1, n);
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int l, r, x;
            cin >> l >> r >> x;
            update(1, 1, n, l, r, x);
        } else {
            int l, r;
            cin >> l >> r;
            cout << get(1, 1, n, l, r) << "\n";
        }
    }
    return 0;
}