#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;
struct tree {
    int l, r;
    ll sum, st, kt;
}tr[N];
int n, m;
void pushup(int u) {
    tr[u].sum = tr[lc].sum + tr[rc].sum;
}
void build(int u, int l, int r) {
    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) { //k首项，s公差
    int x = tr[u].r - tr[u].l + 1; // 项数
    tr[u].sum += k * x + s * (x - 1) * x / 2; 
}
void pushdown(int u) {
    cal(lc, tr[u].kt, tr[u].st);
    cal(lc, (tr[u].kt + tr[rc].l - tr[u].l) * tr[u].st, tr[u].st);
    tr[lc].kt += tr[u].kt;
    tr[rc].kt += (tr[u].kt + tr[rc].l - tr[u].l) * tr[u].st;
    tr[lc].st += tr[u].st;
    tr[rc].st += tr[u].st;
    tr[u].kt = tr[u].st = 0;
}
void change(int u, int l, int r, int s, int k) { // k是首项，s为公差
    if (l > tr[u].r || r < tr[u].l) return;
    if (l <= tr[u].l && tr[u].r <= r) {
        cal(u, s * (k + tr[u].l - l), s);
        tr[u].kt += s * (k + tr[u].l - l);
        tr[u].st += s;
        return;
    }
    pushdown(u);
    change(lc, l, r, s, k);
    change(rc, l, r, s, k);
    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, s, s);
        } else {
            int l, r;
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }
    }
    return 0;
    return 0;
}