#include <bits/stdc++.h>

using namespace std;

vector <long long> tree;

void push(int x){
    tree[x * 2 + 1] += tree[x];
    tree[x * 2 + 2] += tree[x];
    tree[x] = 0;
}

void upd(int id, int l, int r, int ll, int rr, int s)
{

    if (rr <= l || ll  >= r){
        return;
    }

    if (r <= rr && l >= ll){
        cout << l << ' ' << r << endl;
        tree[id] += s;
        tree[id] = (tree[id] < 0 ? 0 : tree[id]);
        return;
    }

    push(id);

    int m = (l + r) / 2;
    upd(id * 2 + 1, l, m, ll, rr, s);
    upd(id * 2 + 2, m, r, ll, rr, s);
    return;
}


int fun(int id, int l, int r, int ll, int rr)
{
    if (rr <= l || ll  >= r){
        return 0;
    }

    if (r <= rr && l >= ll){
        return tree[id] * (r - l);
    }

    push(id);

    int m = (l + r) / 2;
    return fun(id * 2 + 1, l, m, ll, rr) + fun(id * 2 + 2, m, r, ll, rr);
}



int main()
{
    /*ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);*/

    int n,m;
    cin >> n >> m;
    n++;
    tree.resize(4*n, 0);

    for (int i = 0; i < m; ++i){
        int a;
        cin >> a;
        if (a == 1){
            int l, r, s;
            cin >> l >> r >> s;
            r++;
            upd(0, 0, n, l, r, s);
            cout << "__________";
        } else {
            int l, r;
            cin >> l >> r;
            r++;
            cout << fun(0, 0, n, l, r) << '\n';
        }
    }
}