#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,b) rng(i,0,b)
#define repn(i,b) rng(i,1,b+1)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define all(x) x.begin(), x.end()
#define tct template<class t>
#define tctu template<class t, class u>
#define BT 1<<20

tctu bool chmax(t&a, u b){ if(a<b){a=b;return true;}return false;}
tct using vc = vector <t>;
	
typedef pair <int,int> P;

struct Q{
	ll bottom,sum,score;
	Q(ll bottom=0,ll sum=0,ll score=0):bottom(bottom),sum(sum),score(score){};
	void print(){
		cout<<"x : "<<bottom<<" "<<sum<<" "<<score<<endl;
	}
};
struct segtree{
	Q seg[BT];
	int mum;
	
	void init(int n){
		mum=1;
		while(mum<n) mum<<=1;
		for(int i=0;i<mum*2;i++) seg[i]=Q();
	}
	Q merge(int k,Q x){
		if(k>=mum-1){
			Q ret;
			ret.bottom=max(seg[k].bottom,x.bottom-seg[k].sum);
			ret.sum=seg[k].sum+x.sum;
			ret.score=x.score;
			if(seg[k].sum>x.bottom){
				ret.score+=(seg[k].score/seg[k].sum)*(seg[k].sum-x.bottom);
			}
			return ret;
		} else{
			Q ret;
			ret.bottom=max(seg[k].bottom,x.bottom-seg[k].sum);
			ret.sum=seg[k].sum+x.sum;
			if(seg[k*2+1].sum-seg[k*2+2].bottom<=seg[k].sum-x.bottom){
				Q vr=merge(k*2+2,x);
				ret.score=seg[k].score-seg[k*2+2].score+vr.score;
			} else{
				x.bottom-=seg[k*2+2].sum;
				x.sum+=seg[k*2+2].sum;
				Q vl=merge(k*2+1,x);
				ret=vl;
			}
			return ret;
		}
	}
	void ins(int k,Q q){
		//cout<<k<<" "<<q.bottom<<" "<<q.sum<<" "<<q.score<<endl;
		k+=mum-1;
		seg[k]=q;
		while(k>0){
			k=(k-1)/2;
			seg[k]=merge(k*2+1,seg[k*2+2]);
		}
		//seg[1].print();
		//seg[2].print();
		//cout<<"merge";
		//seg[0].print();
	}
	Q query(int a,int b,int k,int l,int r,Q x){
		if(b<=l||r<=a) return x;
		if(a<=l&&r<=b) return merge(k,x);
		else{
			Q vr=query(a,b,k*2+2,(l+r)/2,r,x);
			Q vl=query(a,b,k*2+1,l,(l+r)/2,vr);
			return vl;
		}
	}
	Q query(int a,int b,Q x){
		return query(a,b,0,0,mum,x);
	}
}seg;
void solve(){
	int n,m;
	cin>>n>>m;
	vc<ll> T(m),L(m),R(m),X(m),Y(m);
	vc<ll> W(m),K(m);
	vc<ll> ans(m);
	vc<vc<int> > val(n+1);
	for(int i=0;i<m;i++){
		cin>>T[i];
		if(T[i]==1){
			cin>>L[i]>>R[i]>>X[i]>>Y[i];
			L[i]--,R[i]--;
			val[L[i]].pb(i);
			val[R[i]+1].pb(i);
		} else if(T[i]==2){
			cin>>L[i]>>R[i]>>W[i];
			L[i]--,R[i]--;
			val[L[i]].pb(i);
			val[R[i]+1].pb(i);
		} else{
			cin>>K[i]>>L[i]>>R[i];
			K[i]--;
			L[i]--;
			val[K[i]].pb(i);
		}
	}
	seg.init(m);
	for(int i=0;i<n;i++){
		for(int j=0;j<val[i].size();j++){
			int id=val[i][j];
			if(T[id]==1){
				if(L[id]==i) seg.ins(id,Q(0,X[id],X[id]*Y[id]));
				else seg.ins(id,Q());
			} else if(T[id]==2){
				if(L[id]==i) seg.ins(id,Q(W[id],-W[id],0));
				else seg.ins(id,Q());
			}
		}
		for(int j=0;j<val[i].size();j++){
			int id=val[i][j];
			if(T[id]==3){
				Q q=seg.query(0,id+1,Q());
				L[id]-=q.bottom,R[id]-=q.bottom;
				ll s=q.score;
				if(q.sum>R[id]){
					Q x=Q(q.sum-R[id],R[id]-q.sum,0);
					Q a=seg.query(0,id+1,x);
					s=a.score;
				}
				ll t=q.score;
				if(q.sum>L[id]){
					Q x=Q(q.sum-L[id],L[id]-q.sum,0);
					Q a=seg.query(0,id+1,x);
					t=a.score;
				}
				//cout<<"query "<<id<<" "<<s<<" "<<t<<endl;
				//cout<<q.sum<<" "<<q.score<<endl;
				ans[id]=s-t;
			}
		}
	}
	for(int i=0;i<m;i++){
		if(T[i]==3) cout<<ans[i]<<endl;
	}
					
}
					
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(20);
	int T=1;
	while(T--) solve();
}