#include <bits/stdc++.h>
using namespace std;
#define FILE(x) freopen(x".in", "r", stdin);freopen(x".out", "w", stdout);
const int N = 1e6;
long long t[N << 2], d[N << 2], d2[N << 2];
int n;
void add(int x, long long v, int L, int R){
	t[x] += v * (R - L + 1);
	d[x] += v;
	return;
}
void add2(int x, long long v, int L, int R){
	if (L == R){
		t[x] += v;
	} else {
		d2[x] += v;
	}
	return;
}
void pushup(int x){
	t[x] = t[x << 1] + t[x << 1 | 1];
	return;
}
void pushdown(int x, int L, int R){
	int mid = (L + R) >> 1;
	if (d[x]){
		add(x << 1, d[x], L, mid);
		add(x << 1 | 1, d[x], mid + 1, R);
		d[x] = 0;
	}
	if (d2[x]){
		add2(x << 1, d2[x], L, mid);
		t[x << 1 | 1] += d2[x] * (mid - L + 1) * (R - mid);
		d[x << 1 | 1] += d2[x] * (mid - L + 1);
//		change(x << 1 | 1, d2[x] * (mid - L + 1), mid + 1, R, mid + 1, R);
		add2(x << 1 | 1, d2[x], mid + 1, R);
		d2[x] = 0;
	}
	pushup(x);
	return;
}
void change(int x, long long v, int l, int r, int L, int R){
	if (l == L && r == R){
		add(x, v, L, R);
		return;
	}
	pushdown(x, L, R);
	int mid = (L + R) >> 1;
	if (r <= mid){
		change(x << 1, v, l, r, L, mid);
	} else if (l > mid){
		change(x << 1 | 1, v, l, r, mid + 1, R);
	} else {
		change(x << 1, v, l, mid, L, mid);
		change(x << 1 | 1, v, mid + 1, r, mid + 1, R);
	}
	pushup(x);
	return;
}
void change2(int x, long long v, int l, int r, int L, int R){
	if (l == L && r == R){
		add2(x, v, L, R);
		return;
	}
	pushdown(x, L, R);
	int mid = (L + R) >> 1;
	if (r <= mid){
		change2(x << 1, v, l, r, L, mid);
	} else if (l > mid){
		change2(x << 1 | 1, v, l, r, mid + 1, R);
	} else {
		change(1, v * (mid - l + 1), mid + 1, r, 1, n);
		change2(x << 1, v, l, mid, L, mid);
		change2(x << 1 | 1, v, mid + 1, r, mid + 1, R);
	}
	pushup(x);
	return;
}
long long query(int x, int l, int r, int L, int R){
	if (l == L && r == R){
		return t[x];
	}
	pushdown(x, L, R);
	int mid = (L + R) >> 1;
	if (r <= mid){
		return query(x << 1, l, r, L, mid);
	} else if (l > mid){
		return query(x << 1 | 1, l, r, mid + 1, R);
	} else {
		return query(x << 1, l, mid, L, mid) + query(x << 1 | 1, mid + 1, r, mid + 1, R);
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int m, op, l, r, x;
	cin >> n >> m;
	while (m--){
		cin >> op;
		if (op == 1){
			cin >> x >> l >> r;
			change2(1, x, l, r, 1, n);
		} else {
			cin >> l >> r;
			cout << query(1, l, r, 1, n) << "\n";
		}
		for (int i = 1; i <= n; i++){
			int t = query(1, i, i, 1, n);
		}
	}
	return 0;
}