#include <cstdio>
#include <algorithm>
#define nmax 100001
#define amax 400001
using namespace std;
FILE *f=fopen("hotel.in","r"),*g=fopen("hotel.out","w");
int s[amax],m[amax],d[amax],n,a,b,tip;

void update(int nod,int st,int dr)
{
    if(a<=st&&dr<=b)
    {
        if(tip == 2) s[nod]=m[nod]=d[nod]=dr-st+1;
        else s[nod]=m[nod]=d[nod]=0;
        return;
    }
    int mij = (st+dr)/2;
    if(m[nod]==0)
    {
        s[nod*2]=m[nod*2]=d[nod*2]=0;
        s[nod*2+1]=m[nod*2+1]=d[nod*2+1]=0;
    }
    if(m[nod]==dr-st+1)
    {
        s[nod*2]=m[nod*2]=d[nod*2]=mij-st+1;
        s[nod*2+1]=m[nod*2+1]=d[nod*2+1]=dr-mij;
    }

    if(a<=mij)
        update(nod*2,st,mij);
    if(b>mij)
        update(nod*2+1,mij+1,dr);

    if(s[nod*2]==mij-st+1)
        s[nod]=s[nod*2]+s[nod*2+1];
    else
        s[nod]=s[nod*2];

    if(d[nod*2+1]==dr-mij)
        d[nod]=d[nod*2]+d[nod*2+1];
    else
        d[nod]=d[nod*2+1];

    m[nod]=max(max(m[nod*2],m[nod*2+1]),d[nod*2]+s[nod*2+1]);
}

int main()
{
    int i,q;
    fscanf(f,"%d %d",&n,&q);
    for(i=1;i<=n;++i)
    {
        a=i; b=i; tip=2;
        update(1,1,n);
    }
    for(i=1;i<=q;i++)
    {
        fscanf(f,"%d",&tip);
        if(tip==3)
            fprintf(g,"%d\n",m[1]);
        else
        {
            fscanf(f,"%d %d",&a,&b);
            b=a+b-1;
            update(1,1,n);
        }
    }
    fclose(f);
    fclose(g);
    return 0;
}