#include <bits/stdc++.h>
#define int long long
using namespace std;
const int oo = 1e18 + 7;
int n, m;
int a[100005];
int st[4 * 100005], lazy[4 * 100005];

void down(int id, int l, int r) {
    int t = lazy[id];
    if (t && l != r) {
        lazy[id * 2] += t;
        lazy[id * 2 + 1] += t;
        int mid = (l + r) / 2;
        st[id * 2] += t * (mid - l + 1);
        st[id * 2 + 1] += t * (r - mid);
        lazy[id] = 0;
    }
}

void upd(int id, int l, int r, int u, int v, int val) {
    if (r < u || l > v) return;
    if (l >= u && r <= v) {
        st[id] += val * (r - l + 1);
        lazy[id] += val;
        return;
    }
    down(id, l, r);
    int mid = (l + r) / 2;
    upd(id * 2, l, mid, u, v, val);
    upd(id * 2 + 1, mid + 1, r, u, v, val);
    st[id] = st[id * 2] + st[id * 2 + 1];
}

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return 0;
    if (l >= u && r <= v) return st[id];
    int mid = (l + r) / 2;
    down(id, l, r);
    return get(id * 2, l, mid, u, v) + get(id * 2 + 1, mid + 1, r, u, v);
}

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    freopen("TEST.inp", "r", stdin);
    freopen("TEST.out", "w", stdout);
    cin >> n >> m;

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

        if (type == 1) {
            int u, v, x;
            cin >> u >> v >> x;
            u++;
            v++;
            upd(1, 1, n, u, v - 1, x);

        } else {
            int l, r;
            cin >> l >> r;
            l++;
            r++;

            cout << get(1, 1, n, l, r - 1) << '\n';

        }

    }

    return 0;
}