#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? (-1) : (f),c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

const int N = 1e5 + 10;
int n,m,tmpcnt,tmp[N],tl[N],tr[N],q1cnt,q1[N],id[N];
bool isqry[N];
ll ans[N];

struct OP{
	ll i,t,a,b;
}ops[N];

vector <int> mvec[N],qvec[N];

inline pair<ll,ll> c1(pair<ll,ll> lhs,pair<ll,ll> rhs){
	return mk(max(rhs.fi,lhs.fi + rhs.se),lhs.se + rhs.se);
}

inline pair<ll,ll> c2(pair<ll,ll> lhs,pair<ll,ll> rhs){
	return mk(lhs.fi + rhs.fi,min(lhs.se,lhs.fi + rhs.se));
}

namespace TR{
	pair<ll,ll> ad[N << 1];//mx,ad
	pair<ll,ll> mn[N << 1];//sum,mn
	int val[N << 1];
	ll ar[N << 1];
	ll calc(int i,int l,int r,ll x){//x <= 0
		if (l == r) return val[i] * max(0ll,ad[i].se + x);
		int mid = (l + r) >> 1;
		ll rsz = max(ad[i << 1 | 1].fi,ad[i << 1 | 1].se);
		if (rsz + x >= 0) return ar[i << 1] + calc(i << 1 | 1,mid + 1,r,x);
		else return calc(i << 1,l,mid,min(0ll,mn[i << 1 | 1].se) + x + rsz);
	}
	void pushup(int i,int l,int r){
		if (l == r) return ;
		int mid = (l + r) >> 1;
		ad[i] = c1(ad[i << 1],ad[i << 1 | 1]);
		mn[i] = c2(mn[i << 1],mn[i << 1 | 1]);
		ar[i << 1] = calc(i << 1,l,mid,min(0ll,mn[i << 1 | 1].se));
	}
	void modify(int i,int l,int r,int p,ll v1,int v2){
		if (l == r){
			if (v1 == 0) ad[i] = mk(0,0),mn[i] = mk(0,0),val[i] = 0;
			if (v1 > 0) ad[i] = mk(0,v1),mn[i] = mk(v1,v1),val[i] = v2;
			if (v1 < 0) ad[i] = mk(0,v1),mn[i] = mk(v1,v1),val[i] = 0;
			return ;
		}
		int mid = (l + r) >> 1;
		if (p <= mid) modify(i << 1,l,mid,p,v1,v2);
		else modify(i << 1 | 1,mid + 1,r,p,v1,v2);
		pushup(i,l,r);
	}
	pair<ll,ll> querysz(int i,int l,int r,int ql,int qr){
		if (ql > qr) return mk(0,0);
		if (l >= ql && r <= qr) return ad[i];
		int mid = (l + r) >> 1;pair<ll,ll> ans = mk(0,0);
		if (ql <= mid) ans = c1(ans,querysz(i << 1,l,mid,ql,qr));
		if (qr > mid) ans = c1(ans,querysz(i << 1 | 1,mid + 1,r,ql,qr));
		return ans;
	}
	pair<ll,ll> querymn(int i,int l,int r,int ql,int qr){
		if (ql > qr) return mk(0,0);
		if (l >= ql && r <= qr) return mn[i];
		int mid = (l + r) >> 1;pair<ll,ll> ans = mk(0,0);
		if (ql <= mid) ans = c2(ans,querymn(i << 1,l,mid,ql,qr));
		if (qr > mid) ans = c2(ans,querymn(i << 1 | 1,mid + 1,r,ql,qr));
		return ans;
	}
	void query(int i,int l,int r,int ql,int qr){
		if (ql > qr) return ;
		if (l >= ql && r <= qr) {++tmpcnt,tmp[tmpcnt] = i,tl[tmpcnt] = l,tr[tmpcnt] = r;return ;}
		int mid = (l + r) >> 1;
		if (ql <= mid) query(i << 1,l,mid,ql,qr);
		if (qr > mid) query(i << 1 | 1,mid + 1,r,ql,qr);
	}
}

ll query(int tim,int pos){
	int l = 0,r = tim;
	while (l < r){
		int mid = (l + r) >> 1;
		auto p = TR::querysz(1,1,m,1,mid),s = TR::querymn(1,1,m,mid + 1,tim);
		ll v1 = max(p.fi,p.se),v2 = min(0ll,s.se);
		if (v1 + v2 >= 0) r = mid;
		else l = mid + 1;
	}
	if (l == tim) return 0;
	int p1 = l + 1;
	l = 0,r = tim;
	while (l < r){
		int mid = (l + r) >> 1;
		auto p = TR::querysz(1,1,m,1,mid);
		auto s = TR::querymn(1,1,m,mid + 1,tim);
		ll v1 = max(p.fi,p.se),v2 = min(0ll,s.se);
		if (v1 + v2 >= pos) r = mid;
		else l = mid + 1;
	}
	int p2 = l - 1;
	ll ans = 0;
	auto p = TR::querysz(1,1,m,1,l - 1);
	ans += (pos - max(p.fi,p.se)) * ops[id[l]].b;
	tmpcnt = 0;TR::query(1,1,m,p1,p2);
	ll lst = 0;
	for (int i = tmpcnt;i >= 1;i--){
		ans += TR::calc(tmp[i],tl[i],tr[i],lst);
		lst = min(0ll,max(TR::ad[tmp[i]].fi,TR::ad[tmp[i]].se) + lst) + min(0ll,TR::mn[tmp[i]].se);
	}
	return ans;
}

int main(){
#ifndef ONLINE_JUDGE
	// freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	n = read(),m = read();
	int cnt = 0;
	for (int i = 1;i <= m;i++){
		int t = read();
		if (t == 1){
			ll l = read(),r = read(),x = read(),y = read();
			ops[++cnt] = (OP){i,1,x,y};
			mvec[l].emplace_back(cnt);
			mvec[r + 1].emplace_back(-cnt);
			q1[++q1cnt] = cnt;
			id[i] = cnt;
		}
		if (t == 2){
			ll l = read(),r = read(),w = read();
			ops[++cnt] = (OP){i,2,w,0};
			mvec[l].emplace_back(cnt);
			mvec[r + 1].emplace_back(-cnt);
			id[i] = cnt;
		}
		if (t == 3){
			ll k = read(),p = read(),q = read();
			ops[++cnt] = (OP){i,3,q,0};
			qvec[k].emplace_back(cnt);
			ops[++cnt] = (OP){-i,3,p - 1,0};
			qvec[k].emplace_back(cnt);
			isqry[i] = 1;
			id[i] = cnt;
		}
	}
	for (int i = 1;i <= n;i++){
		for (int p : mvec[i]){
			if (p > 0){
				if (ops[p].t == 1) TR::modify(1,1,m,ops[p].i,ops[p].a,ops[p].b);
				else TR::modify(1,1,m,ops[p].i,-ops[p].a,0);
			}else TR::modify(1,1,m,ops[-p].i,0,0);
		}
		for (int p : qvec[i]){
			ll v = query(abs(ops[p].i),ops[p].a);
			if (ops[p].i > 0) ans[ops[p].i] += v;
			else ans[-ops[p].i] -= v;
		}
	}
	for (int i = 1;i <= m;i++) if (isqry[i]) printf("%lld\n",ans[i]);
	return 0;
}