#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pi pair<ll, ll>
#define N 4444444
#define ls(x) ((x) << 1)
#define rs(x) (((x) << 1) | 1)
ll n, m, s, l, r, op;
struct sgt{
	ll sum[N], tl[N], tr[N];
	//ll lv[N], rv[N];
	void pushup(int t){
		sum[t] = sum[ls(t)] + sum[rs(t)];
	}
	void add(int rt, ll l, ll r, ll x, ll s){
		sum[rt] += (r - l + 1) * (l + r - 2 * x + 2) / 2 * s;
		tl[rt] += s * (l - x + 1);
		tr[rt] += s * (r - x + 1);
	}
	void add2(int rt, ll l, ll r, ll s, ll t){
		sum[rt] += (r - l + 1) * (s + t) / 2;
		tl[rt] += s;
		tr[rt] += t;
	}
	void pushdown(int rt, ll l, ll r){
		if(!tl[rt] && !tl[rt])
			return;
		int mid = (l + r) >> 1;
		ll d = (tr[rt] - tl[rt]) / (r - l);
		add2(ls(rt), l, mid, tl[rt], tl[rt] + (mid - l) * d);
		add2(rs(rt), mid + 1, r, tl[rt] + (mid - l + 1) * d, tr[rt]);
		tl[rt] = tr[rt] = 0;
	}
	void update(int rt, ll l, ll r, ll x, int y, ll s){
		if(x <= l && r <= y){
			add(rt, l, r, x, s);
			return;
		}
		pushdown(rt, l, r);
		int mid = (l + r) >> 1;
		if(x <= mid)
			update(ls(rt), l, mid, x, y, s);
		if(y > mid)
			update(rs(rt), mid + 1, r, x, y, s);
		pushup(rt);
	}
	ll query(int rt, int l, int r, int x, int y){
		if(x <= l && r <= y){
			return sum[rt];
		}
		pushdown(rt, l, r);
		int mid = (l + r) >> 1;
		ll ans = 0;
		if(x <= mid)
			ans += query(ls(rt), l, mid, x, y);
		if(y > mid)
			ans += query(rs(rt), mid + 1, r, x, y);
		pushup(rt);
		return ans;
	}
}st;
int main(){
	scanf("%lld%lld", &n, &m);
	for(int i = 1 ; i <= m ; i++){
		scanf("%lld", &op);
		if(op == 1){
			scanf("%lld%lld%lld", &s, &l, &r);
			st.update(1, 1, n, l, r, s);
			//cerr << st.query(1, 1, n, l, r) << "\n";
		}
		else{
			scanf("%lld%lld", &l, &r);
			printf("%lld\n", st.query(1, 1, n, l, r));
		}
	}
	return 0;
}
/*
10 7
1 2 6 9
2 4 6
1 -4 2 8
2 2 6
1 -3 1 9
2 6 8
2 4 8
2
-58
-123
-178
*/