#ifndef LOCAL_RUN
	#define NDEBUG
#endif
#ifdef GNU_DEBUG
	#define _GLIBCXX_DEBUG 1
	#define _GLIBCXX_DEBUG_PEDANTIC 1
	#define _GLIBCXX_SANITIZE_VECTOR 1
#endif
#include <bits/stdc++.h>
namespace {
#define mset(a, b) memset(&a, b, sizeof(a))
#define ALL(v) std::begin(v), std::end(v)
#define RANGE(a, l, r) (std::begin(a) + (l)), (std::begin(a) + ((r) + 1))
#define fir(i, a, b, ...) for (int i = (a), ##__VA_ARGS__; i <= (b); ++i)
#define firr(i, a, b, ...) for (int i = (a), ##__VA_ARGS__; i >= (b); --i)
#ifdef LOCAL_RUN
	template<class T> void dbgpr(const T& x) {std::cerr << x << std::endl;}
	template<class T, class... Args> void dbgpr(const T& x, const Args&... args) {std::cerr << x << ", ", dbgpr(args...);}
	template<class... Args> void dbgprint(const char* s, const Args&... args) {std::cerr << s << " = ", dbgpr(args...);}
	#define debug(...) dbgprint(#__VA_ARGS__, __VA_ARGS__)
	#define DEBUG if (true)
#else
	#define debug(...) void()
	#define DEBUG if (false)
#endif
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
template<class T> void rei(T& x) {
	bool f = false; int ch; x = 0;
	while (!isdigit(ch = getchar())) f = ch == '-';
	do x = x * 10 + (ch & 15); while (isdigit(ch = getchar()));
	if (f) x = -x;
}
template<class T1, class T2> bool cmax(T1& a, const T2& b) {return a < b ? a = b, true : false;}
template<class T1, class T2> bool cmin(T1& a, const T2& b) {return b < a ? a = b, true : false;}
using namespace std;

const int MAXN = 1e5 + 5;

int n, anstot, chgtot;
struct Qry {int tim, op, x, y; LL w;};
array<vector<Qry>, MAXN> qry;
array<LL, MAXN> ans;

struct Chg {int x, y; LL w;};
array<Chg, MAXN> chg;

void solve(const Qry& q) {
	if (q.op < 0) {
		chg[q.tim] = {};
		return;
	}
	if (q.op == 1) {
		chg[q.tim] = {q.x, q.y, 0};
		return;
	}
	if (q.op == 2) {
		chg[q.tim] = {0, 0, q.w};
		return;
	}
	vector<pair<int, int>> stk;
	fir (i, 1, q.tim) {
		auto& c = chg[i];
		if (c.x) {
			stk.emplace_back(c.x, c.y);
		} else {
			LL w = c.w;
			while (w && stk.size()) {
				if (w < stk.back().first) {
					stk.back().first = int(stk.back().first - w);
					break;
				}
				w -= stk.back().first;
				stk.pop_back();
			}
		}
	}
	LL w = q.w;
	LL sum = 0;
	for (auto& it : stk) {
		if (w <= it.first) {
			sum += w * it.second;
			break;
		}
		sum += (LL)it.first * it.second;
		w -= it.first;
	}
	ans[q.x] += q.y * sum;
}

void realmain() {
	DEBUG freopen("data.in", "r", stdin);
	int qwe; rei(n), rei(qwe);
	fir (i, 1, qwe) {
		int op; rei(op);
		if (op == 1) {
			chgtot++;
			int L, R, x, y; rei(L), rei(R), rei(x), rei(y);
			qry[L].push_back({chgtot, op, x, y, 0});
			qry[R + 1].push_back({chgtot, -op, 0, 0, 0});
		} else if (op == 2) {
			chgtot++;
			int L, R; LL w; rei(L), rei(R), rei(w);
			qry[L].push_back({chgtot, op, 0, 0, w});
			qry[R + 1].push_back({chgtot, -op, 0, 0, 0});
		} else {
			anstot++;
			int k; LL p, q; rei(k), rei(p), rei(q);
			qry[k].push_back({chgtot, op, anstot, 1, q});
			if (p > 1) qry[k].push_back({chgtot, op, anstot, -1, p - 1});
		}
	}
	fir (cur, 1, n) {
		for (auto& it : qry[cur]) {
			solve(it);
		}
	}
	fir (i, 1, anstot) printf("%lld\n", ans[i]);
}}
signed main(){return realmain(),0;}