#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N=1e5+5;

struct node
{
	int l,r,suml,sumr,minsum,cnt,ans;
};

struct Add
{
	int pos,suml,sumr,ans;
};

vector <int> que[N];
vector <Add> add[N];
node res[N*4];
int val[N];
bool isque[N];

int calccnt(int rt,int val)
{
	if(res[rt].l==res[rt].r)
	{
		if(res[rt].sumr<=0)
			return 0;

		return max(0ll,min(res[rt].sumr,val)-res[rt].suml+1);
	}

	if(res[rt*2+1].minsum+res[rt*2].sumr<=val)
		return res[rt].cnt-res[rt*2+1].cnt+calccnt(rt*2+1,val-res[rt*2].sumr);
	return calccnt(rt*2,val);
}

int calcans(int rt,int val)
{
	if(res[rt].l==res[rt].r)
	{
		if(res[rt].sumr<=0)
			return 0;

		return max(0ll,min(res[rt].sumr,val)-res[rt].suml+1)*(res[rt].ans/(res[rt].sumr-res[rt].suml+1));
	}

	if(res[rt*2+1].minsum<=val)
		return res[rt].ans-res[rt*2+1].ans+calcans(rt*2+1,val);
	return calcans(rt*2,val);
}

node pushup(int rt,node r)
{
	node ans;
	ans.l=res[rt].l, ans.r=r.r;
	ans.suml=res[rt].suml, ans.sumr=r.sumr;
	ans.minsum=min(res[rt].minsum,res[rt].sumr+r.minsum);
	ans.cnt=r.cnt+calccnt(rt,res[rt].sumr+r.minsum);
	ans.ans=r.ans+calcans(rt,res[rt].sumr+r.minsum);
	return ans;
}

void update(int rt,int pos,int suml,int sumr,int ans)
{
	if(res[rt].l==res[rt].r)
	{
		res[rt].suml=suml, res[rt].sumr=sumr, res[rt].ans=ans;
		if(res[rt].sumr<=0)
			res[rt].cnt=0;
		else
			res[rt].cnt=res[rt].sumr,-res[rt].suml+1;
		return;
	}

	int mid=(res[rt].l+res[rt].r)/2;
	if(pos<=mid)
		update(rt*2,pos,suml,sumr,ans);
	else
		update(rt*2+1,pos,suml,sumr,ans);
	res[rt]=pushup(rt*2,res[rt*2+1]);
}

void build(int rt,int l,int r)
{
	res[rt].l=l, res[rt].r=r;
	if(l==r)
		return;

	int mid=(l+r)/2;
	build(rt*2,l,mid);
	build(rt*2+1,mid+1,r);
}

void query(int rt,int l,int r,node& now)
{
	if(l<=res[rt].l && res[rt].r<=r)
	{
		if(res[rt].r==r)
			now=res[rt];
		else
			now=pushup(rt,now);
		return;
	}

	int mid=(res[rt].l+res[rt].r)/2;
	if(mid+1<=r)
		query(rt*2+1,l,r,now);
	if(l<=mid)
		query(rt*2,l,r,now);
}

signed main()
{
//	freopen("1.in","r",stdin);
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=m;i++)
	{
		int op;
		scanf("%lld",&op);
		if(op==1)
		{
			int l,r,x,y;
			scanf("%lld %lld %lld %lld",&l,&r,&x,&y);
			add[l].push_back((Add){i,1,x,x*y});
			add[r+1].push_back((Add){i,0,0,0});
		}
		else if(op==2)
		{
			int l,r,x;
			scanf("%lld %lld %lld",&l,&r,&x);
			add[l].push_back((Add){i,-1,-x,0});
			add[r+1].push_back((Add){i,0,0,0});
		}
		else
		{
			int k,p,q;
			scanf("%lld %lld %lld",&k,&p,&q);
			que[k].push_back(i);
		}
	}

	build(1,1,n);
	for(int i=1;i<=n;i++)
	{
		for(auto x:add[i])
			update(1,x.pos,x.suml,x.sumr,x.ans);

		for(auto x:que[i])
		{
			node ans;
			query(1,1,1,ans);
			val[x]=ans.ans;
			isque[x]=true;
		}
	}

	for(int i=1;i<=m;i++)
		if(isque[i])
			printf("%lld\n",val[i]);
	return 0;
}