#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <map>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <queue>
#include <climits>
using namespace std;


#define MOD 1000000007
using ll = long long;

bool operator<(const pair<int, int>& a, const pair<int, int>& b) {
	if (a.first == b.first) {
		return a.second < b.second;
	}
	return a.first < b.first;
}

const int INF = (1LL << 31) - 1;
const int sqrtN = 512;

struct SqrtDecomposition {
	int N, K;
	vector<ll> data; //内部の値, どのタイミングで変更したか
	vector<ll> bucketSum;
	vector<ll> bucketAdd;
	SqrtDecomposition(int n) : N(n) {
		K = (N + sqrtN - 1) / sqrtN;
		data.assign(K*sqrtN, 0);
		bucketSum.assign(K, 0);
		bucketAdd.assign(K, 0);
	}

	// [s, t)
	void add(ll s, ll t, ll x) {
		for (int k = 0; k < K; ++k) {
			ll l = k * sqrtN, r = (k + 1) *sqrtN;
			if (r <= s || t <= l) continue;
			if (s <= l && r <= t) {
				bucketAdd[k] += x;
			}
			else {
				for (int i = max(s, l); i < min(t, r); ++i) {
					data[i] += x;
					bucketSum[k] += x;
				}
			}
		}
	}

	//[x, y)
	ll getSum(ll s, ll t) {
		ll sum = 0;
		for (int k = 0; k < K; ++k) {
			ll l = k * sqrtN, r = (k + 1)*sqrtN;
			if (r <= s || t <= l) continue;
			if (s <= l && r <= t) {
				sum += bucketSum[k] + bucketAdd[k] * sqrtN;
			}
			else {
				for (int i = max(s, l); i < min(t, r); ++i) {
					sum += data[i] + bucketAdd[k];
				}
			}
		}
		return sum;
	}
};
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	ll n, q; cin >> n >> q;
	SqrtDecomposition sd(n);

	for (int i = 0; i < q; ++i) {
		ll com; cin >> com;
		if (com == 0) {
			ll s, t, x; cin >> s >> t >> x;
			sd.add(s, t+1, x);
		}
		else {
			ll x, y; cin >> x>> y;
			cout << sd.getSum(x, y+1) << endl;
		}
	}
	int a; cin >> a;
	return 0;
}
