#include <bits/stdc++.h>
#define lc (u << 1)
#define rc (u << 1 | 1)
using namespace std;
const int N = 1e6 + 10;
typedef long long ll;
int n, m;
struct tree {
    int l, r;
    ll sum;
    ll k;
    ll s;
}tr[N << 2];
void pushup(int u) { //y
    tr[u].sum = tr[lc].sum + tr[rc].sum;
}
void build(int u, int l, int r) { //y
    tr[u] = {l, r, 0, 0, 0};
    if (l == r) return;
    int mid = (l + r) >> 1;
    build(lc, l, mid);
    build(rc, mid + 1, r);
}
void cal(int u, int k, int s) { //y
    int l = tr[u].l, r = tr[u].r;
    tr[u].sum += (2*k+r-l)*(r-l+1)/2*s;
}
void pushdown(int u) { //y
    cal(lc, tr[u].k, tr[u].s);
    cal(rc, tr[u].k + tr[rc].l - tr[u].l, tr[u].s);
    tr[lc].k = tr[u].k;
    tr[lc].s = tr[u].s;
    tr[rc].k = tr[u].k + tr[rc].l - tr[u].l;
    tr[rc].s = tr[u].s;
    tr[u].s = tr[u].k = 0;
}
void change(int u, int l, int r, int k, int s) { // 任务l的位置的s权值为k
    if (l > tr[u].r || r < tr[u].l) return;
    if (l <= tr[u].l && tr[u].r <= r) {
        pushdown(lc), pushdown(rc);
        pushdown(u);
        cal(u, k + tr[u].l - l, s);
        tr[u].k = k + tr[u].l - l;
        tr[u].s = s;
        return;
    }
    pushdown(u);
    change(lc, l, r, k, s);
    change(rc, l, r, k, s);
    pushup(u);
}
ll query(int u, int l, int r) {
    if (l > tr[u].r || r < tr[u].l) return 0;
    if (l <= tr[u].l && tr[u].r <= r) {
        return tr[u].sum;
    }
    pushdown(u);
    return query(lc, l, r) + query(rc, l, r);
}
int main() {
    scanf("%d%d", &n, &m);
    build(1, 1, n);
    while (m--) {
        int op;
        scanf("%d", &op);
        if (op == 1) {
            int s, l, r;
            scanf("%d%d%d", &s, &l, &r);
            change(1, l, r, 1, s);
        } else {
            int l, r;
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }
    }
    return 0;
}