#include <fstream>
#define nmax 400006*2
using namespace std;
ifstream fin("hotel.in");
ofstream fout("hotel.out");

int sm[nmax],v[nmax],z[nmax],dr,st,val,n,m,vel;

void constr(int nod,int s,int d)
{
    if(s==d)
    {
        z[nod]=1;
        v[nod]=1;
        sm[nod]=1;
        return;
    }
    int mij=(s+d)/2;
    constr(nod*2,s,mij);
    constr(nod*2+1,mij+1,d);
    v[nod]=d-s+1;
    z[nod]=d-s+1;
    sm[nod]=d-s+1;
}

void caz_plec(int nod,int s,int d)
{
    if(s>dr||st>d)
        return;
    if(st<=s&&d<=dr)
    {
        sm[nod]=(d-s+1)*val;
        v[nod]=(d-s+1)*val;
        z[nod]=(d-s+1)*val;
        return;
    }
    else
    {
        int mij=(s+d)/2;
        if(sm[nod]==0)
        {
            v[2*nod]=0;
            v[2*nod+1]=0;
            z[2*nod]=0;
            z[2*nod+1]=0;
            sm[2*nod]=0;
            sm[2*nod+1]=0;
        }
        if(sm[nod]==d-s+1)
        {
            v[2*nod]=mij-s+1;
            z[2*nod]=mij-s+1;
            sm[2*nod]=mij-s+1;
            sm[2*nod+1]=d-mij;
            v[2*nod+1]=d-mij;
            z[2*nod+1]=d-mij;
        }
        caz_plec(2*nod,s,mij);
        caz_plec(2*nod+1,mij+1,d);
        z[nod]=z[2*nod+1];
        v[nod]=v[2*nod];
        if(sm[nod*2]==mij-s+1)
            v[nod]=max(v[nod],sm[2*nod]+v[nod*2+1]);
        if(sm[nod*2+1]==d-mij)
            z[nod]=max(z[nod],sm[2*nod+1]+z[nod*2]);
        sm[nod]=max(max(sm[nod*2],sm[nod*2+1]),z[2*nod]+v[2*nod+1]);
    }
}

int main()
{
    fin>>n>>m;
    constr(1,1,n);
    for(int i=1;i<=m;i++)
    {
        fin>>vel;
        if(vel==3)
            fout<<sm[1]<<"\n";
        else
        {
            if(vel==2)
            {
                fin>>st>>dr;
                dr+=st;
                dr--;
                val=1;
                caz_plec(1,1,n);
            }
            else
            {
                fin>>st>>dr;
                dr+=st;
                dr--;
                val=0;
                caz_plec(1,1,n);
            }
        }
    }
    return 0;
}