#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(ll i=(a);i<=(b);++i)
#define Rep(i,a,b) for(ll i=(a);i>=(b);--i)
#define Yes printf("Yes")
#define No printf("No")
#define pb push_back
const ll N=5e5+10;
const ll p=1e9+9;
using namespace std;

struct node{
	ll a,b,x,c,d,y,e;
	void add(ll k){e+=k;}
	void sub(ll k){if(e>=k)e-=k;else{y=0;if(d+e>=k)d+=e-k,e=0;else c+=k-d-e,d=e=0;}}
	void tag(){if(!y)d+=e,y=1,e=0;}
	void clear(){if(y)e=y=0;else d+=e,e=0;if(!x){x=1;if(b<=c)a+=c-b,b=d,c=d=0;else b+=d-c,c=d=0;}}
	ll calc(){return e-a+b-c+d;}
}tr[N<<2];
void operator+=(node &a,node b){
	a.sub(b.a),a.add(b.b);
	if(b.x)a.clear();
	a.sub(b.c),a.add(b.d);
	if(b.y)a.tag();
	a.add(b.e);
}

ll n,m;

void pushdown(ll rt){
	tr[rt<<1]+=tr[rt];
	tr[rt<<1|1]+=tr[rt];
	tr[rt]={0,0,0,0,0,0,0};
}
void build(ll rt,ll l,ll r){
	if(l==r)return void(tr[rt]={0,500000,0,0,0,0,0});
	tr[rt]={0,0,0,0,0,0,0};
	ll mid=l+r>>1;
	build(rt<<1,l,mid);
	build(rt<<1|1,mid+1,r);
}
void update(ll rt,ll l,ll r,ll x,ll y,node z){
	if(x<=l&&r<=y)return void(tr[rt]+=z);
	ll mid=l+r>>1;
	pushdown(rt);
	if(x<=mid)update(rt<<1,l,mid,x,y,z);
	if(y>mid)update(rt<<1|1,mid+1,r,x,y,z);
}
void query(ll rt,ll l,ll r,ll x){
	if(l==r)return void(printf("%lld\n",tr[rt].calc()));
	ll mid=l+r>>1;
	pushdown(rt);
	if(x<=mid)query(rt<<1,l,mid,x);
	else query(rt<<1|1,mid+1,r,x);
}

void mian(){
	
	scanf("%lld%lld",&n,&m);
	build(1,1,n);
	while(m--){
		ll opt,l,r;
		scanf("%lld%lld%lld",&opt,&l,&r);
		if(opt==1)update(1,1,n,l,r,{0,1,0,0,0,0,0});
		if(opt==2)update(1,1,n,l,r,{1,0,0,0,0,0,0});
		if(opt==3)update(1,1,n,l,r,{0,0,0,0,0,1,0});
		if(opt==4)update(1,1,n,l,r,{0,0,1,0,0,0,0});
		if(opt==5)query(1,1,n,l);
	}
	
}

int main(){
	int T=1;
//	scanf("%d",&T);
	while(T--)mian();
	return 0;
}