#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#include <unordered_set>
#define int long long
#define pb push_back
#define double long double
#define endl "\n"
#define fir first
#define sec second
#define un unsigned
#define INF 1000000007
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 1000000, R = 1 << 19;
const int MOD = 1e9 + 7;

vector<int> tree;
vector<int> flag;

void push(int v, int size)
{
    for (int i = 0; i < 2; i++)
    {
        tree[v * 2 + i] += flag[v] * size / 2;
        flag[v * 2 + i] += flag[v];
    }

    flag[v] = 0;
    return;
}

void modify(int ql, int qr, int v, int nl, int nr, int add)
{
    if (nr < ql || nl > qr)
    {
        return;
    }

    if (nl >= ql && nr <= qr)
    {
        tree[v] += add * (nr - nl + 1);
        flag[v] += add;
        return;
    }

    push(v, nr - nl + 1);

    int nm = (nl + nr) / 2;

    modify(ql, qr, 2 * v, nl, nm, add);
    modify(ql, qr, 2 * v + 1, nm + 1, nr, add);

    tree[v] = tree[2 * v] + tree[2 * v + 1];
    return;
}

int sum(int ql, int qr, int v, int nl, int nr)
{
    if (nl > qr || nr < ql)
    {
        return 0;
    }

    if (nl >= ql && nr <= qr)
    {
        return tree[v];
    }

    push(v, nr - nl + 1);

    int nm = (nl + nr) / 2;

    int lol = sum(ql, qr, 2 * v, nl, nm);
    int kek = sum(ql, qr, 2 * v + 1, nm + 1, nr);

    return lol + kek;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;

    tree.resize(2 * R + 5, 0);
    flag.resize(2 * R + 5, 0);

    for (int i = 0; i < m; i++)
    {
        int type;
        cin >> type;

        if (type == 1)
        {
            int l, r, x;
            cin >> l >> r >> x;

            modify(l, r, 1, 1, R, x);
        }
        else
        {
            int l, r;
            cin >> l >> r;

            cout << sum(l, r, 1, 1, R) << endl;
        }
    }

    return 0;
}