#include <bits/stdc++.h>
using namespace std;
const int maxn=5e5+10;
int n,q;
struct tag{
    int premin,presum,sufsum,opt,c,has4;
    tag(){premin=presum=sufsum=c=has4=0;opt=1;}
    tag(int _premin,int _presum,int _sufsum,int _opt,int _c,int _has4):
        premin(_premin),presum(_presum),sufsum(_sufsum),opt(_opt),c(_c),has4(_has4){

        }
};
inline void outag(tag a)
{printf("%d %d %d %d %d %d\n",a.premin,a.presum,a.sufsum,a.c,a.opt,a.has4);}
inline tag merge(tag A,tag B)
{
    tag ret;
    
    if(A.has4&&B.has4)
    {
        ret.premin=A.premin;
        ret.presum=A.presum;
        ret.opt=B.opt;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.sufsum=A.sufsum+B.presum+B.sufsum;
            if(ret.opt==2)ret.c=B.c+A.sufsum+B.presum;
        }
        else
        {
            ret.sufsum=A.c+B.sufsum;
            if(ret.opt==2)ret.c=A.c+B.c;
        }
    }
    else if(!A.has4&&!B.has4)
    {
        ret.premin=min(A.premin,A.presum+B.premin);
        ret.presum=ret.sufsum=A.presum+B.presum;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.opt=B.opt;
            if(ret.opt==2)ret.c=A.sufsum+B.c;
        }
        else
        {
            ret.opt=2;
            ret.c=A.c;
        }
    }
    else if(!A.has4)
    {
        ret.premin=min(A.premin,A.presum+B.premin);
        ret.sufsum=B.sufsum;
        ret.opt=B.opt;
        ret.c=B.c;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
            ret.presum=A.presum+B.presum;
        else 
            ret.presum=A.c;
    }
    else
    {
        ret.premin=A.premin;
        ret.presum=A.presum;
        ret.sufsum=A.sufsum+B.presum;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.opt=B.opt;
            if(ret.opt==2)ret.c=B.c+A.sufsum;
        }
        else 
        {
            ret.opt=2;
            ret.c=A.c;
        }
    }
    return ret;
}
tag val[maxn<<2];
inline void pushtg(int i,tag v)
{
    val[i]=merge(val[i],v);
    return;
}
inline void pushdown(int i)
{
    pushtg(i<<1,val[i]);
    pushtg(i<<1|1,val[i]);
    val[i]=tag();
}
inline void update(int i,int l,int r,int L,int R,tag v)
{
    if(L<=l&&r<=R){pushtg(i,v);return;}
    int mid=l+r>>1;pushdown(i);
    if(L<=mid)update(i<<1,l,mid,L,R,v);
    if(R>mid)update(i<<1|1,mid+1,r,L,R,v);
}
inline int ask(int i,int l,int r,int p)
{
    //printf("!%d %d\n",l,r);
    //outag(val[i]);
    if(l==r)return val[i].has4?val[i].presum+val[i].sufsum:val[i].presum;
    int mid=l+r>>1;pushdown(i);
    if(p<=mid)return ask(i<<1,l,mid,p);
    else return ask(i<<1|1,mid+1,r,p);
}
inline void build(int i,int l,int r)
{
    val[i]=tag();
    if(l==r)return;
    int mid=l+r>>1;
    build(i<<1,l,mid);
    build(i<<1|1,mid+1,r);
}
const int ini=5e5;
int main()
{
    scanf("%d%d",&n,&q);
    build(1,1,n);
    while(q--)
    {
        int opt,l,r;
        scanf("%d%d%d",&opt,&l,&r);
        if(opt==5)printf("%d\n",ask(1,1,n,l)+ini);
        else if(opt==1)update(1,1,n,l,r,(tag){0,1,1,1,0,0});
        else if(opt==2)update(1,1,n,l,r,(tag){-1,-1,-1,1,0,0});
        else if(opt==3)update(1,1,n,l,r,(tag){0,0,0,2,0,0});
        else if(opt==4)update(1,1,n,l,r,(tag){0,0,0,1,0,1});
        //for(int i=1;i<=n;i++)printf("?%d %d\n",i,ask(1,1,n,i));putchar('\n');
    }
}
/*#include <bits/stdc++.h>
using namespace std;
const int maxn=5e5+10;
int n,q;
struct tag{
    int premin,presum,sufsum,opt,c,has4;
    tag(){premin=presum=sufsum=c=has4=0;opt=1;}
    tag(int _premin,int _presum,int _sufsum,int _opt,int _c,int _has4):
        premin(_premin),presum(_presum),sufsum(_sufsum),opt(_opt),c(_c),has4(_has4){

        }
};
inline void outag(tag a)
{printf("%d %d %d %d %d %d\n",a.premin,a.presum,a.sufsum,a.c,a.opt,a.has4);}
inline tag merge(tag A,tag B)
{
    tag ret;
    
    if(A.has4&&B.has4)
    {
        ret.premin=A.premin;
        ret.presum=A.presum;
        ret.opt=B.opt;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.sufsum=A.sufsum+B.presum+B.sufsum;
            if(ret.opt==2)ret.c=B.c+A.sufsum+B.presum;
        }
        else
        {
            ret.sufsum=A.c+B.sufsum;
            if(ret.opt==2)ret.c=A.c+B.c;
        }
    }
    else if(!A.has4&&!B.has4)
    {
        ret.premin=min(A.premin,A.presum+B.premin);
        ret.presum=ret.sufsum=A.presum+B.presum;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.opt=B.opt;
            if(ret.opt==2)ret.c=A.sufsum+B.c;
        }
        else
        {
            ret.opt=2;
            ret.c=A.c;
        }
    }
    else if(!A.has4)
    {
        ret.premin=min(A.premin,A.presum+B.premin);
        ret.sufsum=B.sufsum;
        ret.opt=B.opt;
        ret.c=B.c;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
            ret.presum=A.presum+B.presum;
        else 
            ret.presum=A.c;
    }
    else
    {
        ret.premin=A.premin;
        ret.presum=A.presum;
        ret.sufsum=A.sufsum+B.presum;
        ret.has4=1;
        if(A.opt==1||A.sufsum+B.premin<A.c)
        {
            ret.opt=B.opt;
            if(ret.opt==2)ret.c=B.c+A.sufsum;
        }
        else 
        {
            ret.opt=2;
            ret.c=A.c;
        }
    }
    return ret;
}
tag val[maxn<<2];
inline void pushtg(int i,tag v)
{
    val[i]=merge(val[i],v);
    return;
}
inline void pushdown(int i)
{
    pushtg(i<<1,val[i]);
    pushtg(i<<1|1,val[i]);
    val[i]=tag();
}
inline void update(int i,int l,int r,int L,int R,tag v)
{
    if(L<=l&&r<=R){pushtg(i,v);return;}
    int mid=l+r>>1;pushdown(i);
    if(l==r)return;
    }
}*/