#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;
const ll inf = 1e18;
namespace sub3 {
	struct Node {
		ll a, b;
		Node() { b = -inf; }
		Node(ll c, ll d) { a = c, b = d; }
	} t[maxn << 2];
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define A(x) (t[x].a)
#define B(x) (t[x].b)
	inline void pushdw(int x) {
		if (A(x) || B(x) > -inf) {
			t[ls(x)] = { A(ls(x)) + A(x), max(B(ls(x)) + A(x), B(x)) };
			t[rs(x)] = { A(rs(x)) + A(x), max(B(rs(x)) + A(x), B(x)) };
			A(x) = 0; B(x) = -inf;
		}
	}
	void sgtadd(int l, int r, int ml, int mr, ll LA, ll LB, int x) {
		if (ml <= l && r <= mr) { A(x) += LA; B(x) = max(B(x) + LA, LB); return; }
		int mid = l + r >> 1; pushdw(x);
		if (ml <= mid) sgtadd(l, mid, ml, mr, LA, LB, ls(x));
		if (mr > mid) sgtadd(mid + 1, r, ml, mr, LA, LB, rs(x));
	}
	ll sgtqry(int l, int r, int v, int x) {
		if (l == r) { return max(A(x), B(x)); }
		int mid = l + r >> 1; pushdw(x);
		if (v <= mid) return sgtqry(l, mid, v, ls(x));
		else return sgtqry(mid + 1, r, v, rs(x));
	}
}
using namespace sub3;
int n, m; vector<pii>s[maxn];
ll sum(vector<pii>& d, ll p) {
	ll tot = 0, ans = 0;
	for (int j = 0; j < d.size() && tot < p; j++) ans += (ll)(min(p, tot + d[j].Y) - tot) * d[j].X, tot += d[j].Y;
	return ans;
}
int main() {
	scanf("%d%d", &n, &m);
	if (n <= 5000 && m <= 5000) {
		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);
				if (!s[x].size()) { puts("0"); continue; }
				printf("%lld\n", sum(s[x], q) - sum(s[x], p - 1));
			}
		}
	}
	else {
		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);
				sgtadd(1, n, l, r, x, -inf, 1);
			}
			else if (o == 2) {
				scanf("%d%d%lld", &l, &r, &p);
				sgtadd(1, n, l, r, -p, 0, 1);
			}
			else {
				scanf("%d%lld%lld", &x, &p, &q);
				q = min(q, sgtqry(1, n, x, 1));
				printf("%lld\n", q - p + 1);
			}
		}
	}
	return 0;
}