// Author: Minghan Ye (Donotplaygame)
// Name: C. 栈
// URL: https://qoj.ac/contest/1515/problem/8229
// ML: 1024 MB
// TL: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "E:/OI/normal/templates/debug.h"
#else
#define dbg(...) (void)0
#define msg(...) (void)0
#endif
#define ll long long
#define endl '\n'
#define PB emplace_back
#define PPB pop_back
#define MP make_pair
#define ALL(Name) Name.begin(),Name.end()
#define PII pair<int,int>
#define VI vector<int>
#define fi first
#define se second

const int N=100005;
int n,q;
struct oper
{
	int op,pos;ll x,y;
	oper(int o,int p,ll x,ll y):op(o),pos(p),x(x),y(y){}
};
vector<oper>ops[N],qry[N];
ll ans[N];

#define lid (id<<1)
#define rid (lid|1)
#define mid (l+r>>1)
#define rmd (mid+1)
struct node
{
	ll push,pop,sum,val;
}tr[1<<18];
ll query(int L,int R,ll &cnt,int l=1,int r=q,int id=1)
{
	if(!cnt)return 0;
	if(l==r)
	{
		if(!tr[id].val)return 0;
		ll c=min(cnt,tr[id].push);
		cnt-=c;
		return tr[id].val*c;
	}
	ll res=0;
	if(L<=mid)
	{
		ll rem=max(0ll,tr[lid].push-tr[rid].pop);
		if(L==l&&R==r&&rem<=cnt)cnt-=rem,res+=tr[lid].sum;
		else res+=query(L,min(R,mid),cnt,l,mid,lid);
	}
	if(R>=rmd)res+=query(max(L,rmd),R,cnt,rmd,r,rid);
	return res;
}
void pushup(int id,int l,int r,bool f=1)
{
	if(f)
	{
		tr[id].push=max(0ll,tr[lid].push-tr[rid].pop)+tr[rid].push;
		tr[id].pop=tr[lid].pop+max(0ll,tr[rid].pop-tr[lid].push);
	}
	ll tmp;
	if(!(id&1))tr[id].sum=query(l,r,tmp=max(tr[id].push-tr[id|1].pop,0ll),l,r,id);
	// else tr[id].sum=query(l,r,tmp=tr[id].push,l,r,id);
}
void change(oper &op,int l=1,int r=q,int id=1)
{
	if(l==r)
	{
		if(op.op==1)
			tr[id].push=op.x,tr[id].val=op.y,tr[id].sum=max(0ll,op.x-tr[id|1].pop)*op.y;
		else tr[id].pop=op.x;
		return;
	}
	if(op.pos<=mid)change(op,l,mid,lid);
	else change(op,rmd,r,rid),pushup(lid,l,mid,0);
	pushup(id,l,r);
}

int main()
{
	ios::sync_with_stdio(false),cin.tie(nullptr);
//	int _;cin>>_;while(_--)

	cin>>n>>q;
	for(int i=1;i<=q;i++)
	{
		int op,a,d;ll b,c;
		cin>>op>>a>>b>>c;
		if(op==1)cin>>d,ops[a].PB(1,i,c,d),ops[b+1].PB(1,i,0,0);
		else if(op==2){ops[a].PB(2,i,c,0),ops[b+1].PB(2,i,0,0);}
		else ops[a].PB(3,i,b,c);
	}
	memset(ans,-1,sizeof(ans));
	for(int i=1;i<=n;i++)
		for(auto j:ops[i])
		{
			if(j.op==3)ans[j.pos]=query(1,j.pos,j.y)-query(1,j.pos,--j.x);
			else change(j);
		}
			
	for(int i=1;i<=q;i++)if(~ans[i])cout<<ans[i]<<endl;

	return 0;
}