#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=(a);i<=(n);++i)
#define per(i,a,n) for(int i=(n);i>=(a);--i)
#define SZ(x) ((int)(x).size())

using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn=1e5+10;

inline void rd(){};
template<typename T1,typename ...T2>
inline void rd(T1 &x,T2 &...rest){
    bool w=1; x=0; char ch=getchar();
    while(!isdigit(ch)){w^=(ch=='-');ch=getchar();}
    while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    w?0:x=-x;
    rd(rest...);
}

template<typename T> 
inline void pr(T x,bool op=false){
    x<0?x=-x,putchar('-'):0;
    static short sta[25],top(0);
    do sta[top++]=x%10,x/=10; while(x);
    while(top) putchar(sta[--top]|48);
    op?putchar('\n'):putchar(' ');
} 

int n,m;
vector<array<ll,3>> event[maxn],q[maxn];
ll res[maxn];

namespace sgt{
	ll leftcnt[maxn<<2],leftsum[maxn<<2],sum[maxn<<2],cnt[maxn<<2],right[maxn<<2];

	inline pll up(int p,int l,int r,ll v){ //fi leftcnt se sum
		// printf("up=%d %d %d\n",p,l,r);
		if(cnt[p]<=v) return make_pair(0,0);
		if(l==r){
			return make_pair(cnt[p]-v,(cnt[p]-v)*(sum[p]/cnt[p]));
		}
		int mid=(l+r)>>1;
		if(v<=cnt[p<<1|1]){
			pll t=up(p<<1|1,mid+1,r,v);
			return make_pair(leftcnt[p]+t.first,leftsum[p]+t.second);
		}
		else return up(p<<1,l,mid,v-cnt[p<<1|1]+right[p<<1|1]);
	}

	inline void upd(int p,int l,int r,int x,ll c,ll v){
		// printf("upd=%d %d %d\n",p,l,r);
		if(l==r){
			if(!v) right[p]+=c;
			else cnt[p]+=c,sum[p]+=c*v;
			return;
		}
		int mid=(l+r)>>1;
		if(x<=mid) upd(p<<1,l,mid,x,c,v);
		else upd(p<<1|1,mid+1,r,x,c,v);
		pll t=up(p<<1,l,mid,right[p<<1|1]);
		leftcnt[p]=t.first; leftsum[p]=t.second;
		sum[p]=leftsum[p]+sum[p<<1|1];
		cnt[p]=leftcnt[p]+cnt[p<<1|1];
		right[p]=right[p<<1]+right[p<<1|1]-(cnt[p<<1]-leftcnt[p]);
		// printf("-->%d %lld %lld %lld %lld\n",p,leftcnt[p],sum[p],cnt[p],right[p]);
	}

	inline pll calc(int p,int l,int r,int ql,int qr,ll v){//when right=v,[ql,qr]->cnt and right
		if(ql<=l && r<=qr) return make_pair(max(cnt[p]-v,0ll),right[p]+max(v-cnt[p],0ll));
		int mid=(l+r)>>1;
		if(qr<=mid) return calc(p<<1,l,mid,ql,qr,v);
		if(ql>mid)  return calc(p<<1|1,mid+1,r,ql,qr,v);
		pll res=calc(p<<1|1,mid+1,r,ql,qr,v);
		pll t=calc(p<<1,l,mid,ql,qr,res.second);
		return make_pair(res.first+t.first,t.second);
	}	

	inline ll qry(int p,int l,int r,int x,ll c,ll v){//when right=v,[1,x]->前c个数的sum 
		// printf("qry=%d %d %d %lld %lld\n",p,l,r,c,v);
		if(!c) return 0;
		if(l==r){
			return min(c,max(cnt[p]-v,0ll))*(sum[p]/cnt[p]);
		}
		int mid=(l+r)>>1;
		if(x>=r){
			if(v>=cnt[p<<1|1]) return qry(p<<1,l,mid,x,c,v-cnt[p<<1|1]+right[p<<1|1]);
			else return leftcnt[p]>=c ? qry(p<<1,l,mid,x,c,right[p<<1|1]): leftsum[p]+qry(p<<1|1,mid+1,r,x,c-leftcnt[p],v);
		}
		if(x<=mid) return qry(p<<1,l,mid,x,c,v);
		else{
			pll t1=calc(p<<1|1,mid+1,r,1,x,v);
			pll t2=calc(p<<1,l,mid,1,x,t1.second);
			return qry(p<<1,l,mid,x,min(c,t2.first),t1.second)+qry(p<<1|1,mid+1,r,x,max(c-t2.first,0ll),v);
		}
	}
};
using namespace sgt;

inline void solve(){
	rd(n,m);
	rep(i,1,m){
		int opt,l,r;
		ll x,y;
		rd(opt); res[i]=-1;
		if(opt==1){
			rd(l,r,x,y);
			event[l].push_back({i,x,y});
			event[r+1].push_back({i,-x,y});
		}
		if(opt==2){
			rd(l,r,x);
			event[l].push_back({i,x,0});
			event[r+1].push_back({i,-x,0});
		}
		if(opt==3){
			rd(x,l,r);
			q[x].push_back({i,l,r});
		}
	}
	rep(i,1,n){
		for(auto [id,x,y]:event[i]){
			// printf("%d %lld %lld %lld %lld\n",i,opt,id,x,y);
			upd(1,1,m,id,x,y);
		}
		for(auto [id,x,y]:q[i]){
			pll t=calc(1,1,m,1,id,0);
			if(t.first<x){
				res[id]=0;
				continue;
			}
			res[id]=qry(1,1,m,id,min(y,t.first),0)-qry(1,1,m,id,x-1,0);
			// printf("?%lld %lld %lld %lld\n",id,x-1,min(y,t.first),res[id]);
		}
	}
	rep(i,1,m)
		if(~res[i]) 
			pr(res[i],1);
}

signed main(){
	freopen("air.in","r",stdin);
	freopen("air.out","w",stdout);
    int _=1;
    //scanf("%d",&_); 
    while(_--) solve();
}