#include <iostream>
#include <cstring> 
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
// #include <bits/stdc++.h>

#define int long long
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define Grf(it,u,to) for(int it=he[u],to;(to=e[it],it);it=nxt[it]) 
#define In __inline 
#define OP operator
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
namespace Mine {
	// mt19937_64 wql(514);
	In int read() {
		ll x=1,a=0;
		char ch=getchar();
		while(ch>'9' || ch<'0') x=(ch=='-')?-1:x,ch=getchar();
		while(ch>='0' && ch<='9') a=(a<<1)+(a<<3)+(ch-'0'),ch=getchar();
		return a*x;
	} const int N=1e5+100;
	int n,m;
	namespace S0 {
		struct stk {
			int sts[5005],stv[5005],tot;
			void push(int val,int sum) {sts[++tot]=sum,stv[tot]=val;}
			void pp(int cnt) {
				while(tot && sts[tot]<=cnt) cnt-=sts[tot--];
				if(tot) sts[tot]-=cnt;
			} In int get(int p) {
				int ret=0,i=1; while(i<=tot && p>=sts[i]) {
					p-=sts[i];ret+=sts[i]*stv[i];i++;
				} if(i<=tot) ret+=stv[i]*p;
				return ret;
			} In int get(int l,int r){
				return get(r)-get(l-1);
			} void print() {
				For(i,1,tot) printf("%lld ",sts[i]);
				puts("");
			}
		} mp[5005];
		void solve0() {
			while(m--) {
				// printf("%d :\n",m);
				int opt=read(); if(opt==1) {
					int l=read(),r=read(),x=read(),y=read();
					For(i,l,r) mp[i].push(y,x);
				} else if(opt==2) {
					int l=read(),r=read(),x=read();
					For(i,l,r) mp[i].pp(x);
				} else {
					int x=read(),l=read(),r=read();
					printf("%lld\n",mp[x].get(l,r));
				} //For(i,1,n) mp[i].print();
				// puts("");
			}
		}
	} namespace S1 {
		struct node{
			int x=0,y=0;   ///   a_i = max ( x , a_i + y )
		} tr[N<<2];
		void pushdown(int u) {
			int X=tr[u].x,Y=tr[u].y;
			tr[u<<1].x+=X,tr[u<<1|1].x+=X;
			tr[u<<1].y=max(tr[u<<1].y+X,Y);
			tr[u<<1|1].y=max(tr[u<<1|1].y+X,Y);
			tr[u].x=tr[u].y=0;
		}
		void mdf(int ql,int qr,int val,int u=1,int l=1,int r=n) {
			if(ql<=l && r<=qr) tr[u].x+=val,tr[u].y=0;
			else { int mid=(l+r)>>1; pushdown(u);
				if(ql<=mid) mdf(ql,qr,val,u<<1,l,mid);
				if(mid<qr) mdf(ql,qr,val,u<<1|1,mid+1,r);
			}
		} int ask(int pos,int u=1,int l=1,int r=n) {
			if(l==r) return max(0+tr[u].x,tr[u].y);
			int mid=(l+r)>>1; pushdown(u);
			if(pos<=mid) return ask(pos,u<<1,l,mid);
			return ask(pos,u<<1|1,mid+1,r);
		}
		void solve1() {
			while(m--) {
				// printf("%d :\n",m);
				int opt=read(); if(opt==1) {
					int l=read(),r=read(),x=read(),y=read();
					mdf(l,r,x);
				} else if(opt==2) {
					int l=read(),r=read(),x=read();
					mdf(l,r,-x);
				} else {
					int x=read(),l=read(),r=read();
					int siz=ask(x); 
					printf("%lld\n",min(siz,r)-min(siz,l-1));
				} //For(i,1,n) printf("%lld ",ask(i));
				// putsa("");
			}
		}
	}
	signed main() {
		n=read(),m=read();
		if(n<=5000 && m<=5000) S0::solve0();
		else S1::solve1();
		
		// S1::solve1();
		
		
		
		return 0;
	}
}signed main() {
	// freopen("homework.in","r",stdin);
	// freopen("homework.out","w",stdout);
	return Mine::main();
}