#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long int ll;
using pii = pair<int, int>;
const int maxn = 2e5 + 10;
constexpr int mod = 1e9 + 7;
int n, m; vector<pii>s[maxn];
int main() {
	scanf("%d%d", &n, &m);
	while (m--) {
		int o, l, r, x, y; ll p, q;
		scanf("%d", &o);
		if (o == 1) {
			scanf("%d%d%d%d", &l, &r, &x, &y);
			for (int i = l; i <= r; i++) s[i].push_back({ y, x });
		}
		else if (o == 2) {
			scanf("%d%d%lld", &l, &r, &p); 
			for (int i = l; i <= r; i++) {
				ll np = p;
				while (!s[i].empty() && np - s[i].back().Y >= 0) np -= s[i].back().Y, s[i].pop_back();
				if (!s[i].empty()) s[i].back().Y -= np;
			}
		}
		else {
			scanf("%d%lld%lld", &x, &p, &q); ll d = 0;
			for (int i = 0; i < s[x].size(); i++) d += s[x][i].Y;
			q = min(q, d);
			ll np = 0, nq = 0, sum = 0; int i = 0;
			for (i = 0; i < s[x].size(); i++) {
				if (np + s[x][i].Y < p) np += s[x][i].Y;
				else break;
			}
			sum += min(q - p + 1, nq += (np + s[x][i].Y - p + 1)) * s[x][i].X; ++i;
			for (; i < s[x].size(); i++) {
				if (nq + s[x][i].Y <= q - p + 1) sum += (ll)s[x][i].X * s[x][i].Y;
				else break;
			}
			if (i != s[x].size()) sum += min((q - p - nq + 1), (ll)s[x][i].Y) * s[x][i].X;
			printf("%lld\n", sum);
		}
	}
	return 0;
}