#include <cstdio>
#include <algorithm>
#define Nmax 100005

using namespace std;

int s[3*Nmax],st[3*Nmax],dr[3*Nmax];

inline void Build(int nod, int l, int r)
{
    if(l==r)
    {
        s[nod]=st[nod]=dr[nod]=1;
        return ;
    }
    int mij=(l+r)/2;
    Build(2*nod,l,mij);
    Build(2*nod+1,mij+1,r);
    s[nod]=st[nod]=dr[nod]=s[nod*2]+s[nod*2+1];
}

inline void Update(int nod, int l, int r, int val, int x, int y)
{
    if(l==x && y==r)
    {
        s[nod]=st[nod]=dr[nod]=(r-l+1)*(1-val);
        return ;
    }
    int mij=(l+r)/2;
    if(s[nod]==0)
    {
        s[2*nod]=st[2*nod]=dr[2*nod]=0;
        s[2*nod+1]=st[2*nod+1]=dr[2*nod+1]=0;
    }
    if(s[nod]==r-l+1)
    {
        s[2*nod]=st[2*nod]=dr[2*nod]=mij-l+1;
        s[2*nod+1]=st[2*nod+1]=dr[2*nod+1]=r-mij;
    }
    if(y<=mij)
        Update(2*nod,l,mij,val,x,y);
    else
        if(x>mij)
            Update(2*nod+1,mij+1,r,val,x,y);
        else
        {
            Update(2*nod,l,mij,val,x,mij);
            Update(2*nod+1,mij+1,r,val,mij+1,y);
        }

    val=st[2*nod];
    if(val==mij-l+1)
        val+=st[2*nod+1];
    st[nod]=val;

    val=dr[2*nod+1];
    if(val==r-mij)
        val+=dr[2*nod];
    dr[nod]=val;

    val=dr[2*nod]+st[2*nod+1];
    val=max(val, s[2*nod]);
    val=max(val, s[2*nod+1]);
    s[nod]=val;
    s[nod]=max(s[nod], st[nod]);
    s[nod]=max(s[nod], dr[nod]);
}

int main()
{
    int N,M,x,y,tip;
    freopen ("hotel.in","r",stdin);
    freopen ("hotel.out","w",stdout);
    scanf("%d%d", &N,&M);
    Build(1,1,N);
    while(M--)
    {
        scanf("%d", &tip);
        if(tip==3)
            printf("%d\n", s[1]);
        else
        {
            scanf("%d%d", &x,&y);
            y=x+y-1;
            Update(1,1,N,2-tip,x,y);
        }
    }
}