#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 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 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,l,r,x,y;} q[N];

int main()
{
	n=read(),m=read();
	if(n<=5000 && m<=5000) solve1();
	// else {
		// int op,l,
	// }
	
	return 0;
}