#include <bits/stdc++.h>

using namespace std;

inline int read()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second
#define pb push_back
#define mid ((l+r)>>1)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef unsigned long long ull;
const int N=1e5+10,M=5010;

int n,m;

LL get_sum(vector<PII> &v,LL pos) {
	LL tot=0,ans=0;
	for(int j=0;j<(int)v.size() && tot<pos;j++) 
		ans+=(LL)(min(pos,tot+v[j].x)-tot)*v[j].y,tot+=v[j].x;
	return ans;
}
void solve1()
{
	int op,l,r,x,y;
	vector<PII> a[M];
	while(m--) {
		op=read();
		if(op==1) {
			l=read(),r=read(),x=read(),y=read();
			rep(i,l,r) a[i].pb({x,y});
		}
		else if(op==2) {
			LL t; l=read(),r=read(),scanf("%lld",&t);
			rep(i,l,r) {
				LL x=t;
				while(a[i].size()>0 && a[i].back().x<=x) x-=a[i].back().x,a[i].pop_back();
				if(x && a[i].size()>0) a[i][a[i].size()-1].x-=x;
			}
		}
		else {
			x=read(); LL l,r;
			scanf("%lld%lld",&l,&r);
			printf("%lld\n",get_sum(a[x],r)-get_sum(a[x],l-1));
		}
	}
}

struct Query {int op; LL l,r,x,y;} q[N];

PLL tag[N<<2];
void pushtag(int u,PLL v) {tag[u].x+=v.x,tag[u].y=max(tag[u].y+v.x,v.y);}
void pushdown(int u) {pushtag(u<<1,tag[u]),pushtag(u<<1|1,tag[u]),tag[u]={0,0};}
void modify(int u,int l,int r,int L,int R,LL vx,LL vy) {
	if(l>=L && r<=R) return pushtag(u,{vx,vy});
	pushdown(u);
	if(mid>=L) modify(u<<1,l,mid,L,R,vx,vy);
	if(mid<R) modify(u<<1|1,mid+1,r,L,R,vx,vy);
}
LL query(int u,int l,int r,int pos) {
	if(l==r) return max(tag[u].x,tag[u].y);
	pushdown(u);
	if(mid>=pos) return query(u<<1,l,mid,pos);
	return query(u<<1|1,mid+1,r,pos);
}

void solve3() {
	for(int i=1;i<=m;i++) {
		auto &[op,l,r,x,y]=q[i];
		// cout<<op<<' '<<l<<' '<<x<<' '<<y<<endl;
		if(op==1) modify(1,1,n,l,r,x,0);
		else if(op==2) modify(1,1,n,l,r,-x,0);
		else printf("%lld\n",max(min(r,query(1,1,n,x))-l+1,0ll));
	}
}

int main()
{
	n=read(),m=read();
	if(n<=5000 && m<=5000) solve1();
	else {
		int op; bool sub3=1;
		for(int i=1;i<=m;i++) {
			q[i].op=op=read();
			if(op==1) scanf("%lld%lld%lld%lld",&q[i].l,&q[i].r,&q[i].x,&q[i].y),sub3&=(q[i].y==1);
			else if(op==2) scanf("%lld%lld%lld",&q[i].l,&q[i].r,&q[i].x);
			else scanf("%lld%lld%lld",&q[i].x,&q[i].l,&q[i].r);
		}
		if(sub3) solve3();
	}
	
	return 0;
}