#include<cstdio>
#define max(a,b) (a>b?a:b)
#define NMAX 100005
#define INF -100001
using namespace std;
int x,y,n,p,i,t;
int arb[NMAX*4],a[NMAX*4],b[NMAX*4],c[NMAX*4];
void gen(int nod,int st,int dr)
{
    arb[nod]=a[nod]=b[nod]=dr-st+1;
    if (st==dr);
    else
    {
        int mij=(st+dr)/2;
        gen(nod*2,st,mij);
        gen(nod*2+1,mij+1,dr);
    }
}
void update(int nod,int st,int dr,bool cat)
{
    if (x<=st && dr<=y)
    {
        if (!cat) arb[nod]=a[nod]=b[nod]=dr-st+1;
            else arb[nod]=a[nod]=b[nod]=0;
        return;
    }
    else
    {
        if (arb[nod]==0)
        {
            arb[nod*2]=a[nod*2]=b[nod*2]=0;
            arb[nod*2+1]=b[nod*2+1]=a[nod*2+1]=0;
        }
        if (arb[nod]==dr-st+1)
        {
            arb[nod*2]=a[nod*2]=b[nod*2]=(st+dr)/2-st+1;
            arb[nod*2+1]=a[nod*2+1]=b[nod*2+1]=dr-(st+dr)/2;
        }
        int mij=(st+dr)/2;
        if (x<=mij) update(nod*2,st,mij,cat);
        if (y>mij) update(nod*2+1,mij+1,dr,cat);

        arb[nod]=max(max(arb[nod*2],arb[nod*2+1]),b[nod*2]+a[nod*2+1]);
        a[nod]=a[nod*2];
        b[nod]=b[nod*2+1];
        //ramura stanga
        if (a[nod*2]==(st+dr)/2-st+1)
            a[nod]+=a[nod*2+1];
        //ramura dreapta
        if (b[nod*2+1]==dr-(st+dr)/2)
            b[nod]+=b[nod*2];
    }
}
int main()
{
    freopen("hotel.in","r",stdin);
    freopen("hotel.out","w",stdout);
    scanf("%d%d",&n,&p);
    x=1;y=n;
    gen(1,1,n);
    for (i=1;i<=p;++i)
    {
        scanf("%d",&t);
        if (t==1)
        {
            scanf("%d%d",&x,&y);
            y=y+x-1;
            update(1,1,n,true);
        }
        else if (t==2)
        {
            scanf("%d%d",&x,&y);
            y=y+x-1;
            update(1,1,n,false);
        }
        else
        {
           printf("%d\n",arb[1]);
        }
    }
    return 0;
}