#include <bits/stdc++.h>
using namespace std;
using ll = long long;

class LazySegmentTree {
public:
	const int n;
	const ll id = 0;
	vector<ll> data, data2;
	int size(int n) {
		int res = 1;
		while (res < n) res <<= 1;
		return res;
	}
	ll sub(int l, int r, int node, int lb, int ub) {
		if (ub <= l || r <= lb) return id;
		if (l <= lb && ub <= r) {
			return data[node] + data2[node] * (ub - lb);
		}
		ll res = data2[node] * (min(r, ub) - max(l, lb));
		return res + sub(l, r, node * 2, lb, (lb + ub) / 2) + sub(l, r, node * 2 + 1, (lb + ub) / 2, ub);
	}
	void suc(int l, int r, int node, int lb, int ub, ll val) {
		if (ub <= l || r <= lb) return;
		if (l <= lb && ub <= r) {
			data2[node] += val;
			return;
		}
		data[node] += val * (min(r, ub) - max(l, lb));
		suc(l, r, node * 2, lb, (lb + ub) / 2, val);
		suc(l, r, node * 2 + 1, (lb + ub) / 2, ub, val);
	}
	LazySegmentTree(int n_) :
		n(size(n_)), data(n * 2, id), data2(n * 2, id) {}
	void add(int l, int r, ll val) {
		suc(l, r + 1, 1, 0, n, val);
	}
	ll getSum(int l, int r) {
		return sub(l, r + 1, 1, 0, n);
	}
};

int main()
{
	int n, q, b, s, t, x;
	cin >> n >> q;
	LazySegmentTree lst(n);
	while (q--) {
		cin >> b;
		if (b) {
			cin >> s >> t;
			cout << lst.getSum(s - 1, t - 1) << endl;
		}
		else {
			cin >> s >> t >> x;
			lst.add(s - 1, t - 1, x);
		}
	}
	return 0;
}