#include <cstdio>
#include <iostream>

using namespace std;

int arbint[400050];
int x,y,maxi,t,ans;

void update(int node,int left,int right)
{
    int mid;
    if(x<=left && right<=y)
        arbint[node]=t;
    else
    {
        mid=(left+right)/2;
        if(arbint[node]==1 && arbint[2*node]==0 && arbint[2*node+1]==0)
            arbint[2*node]=arbint[2*node+1]=1;
        if(x<=mid)
            update(2*node,left,mid);
        if(y>=mid+1)
            update(2*node+1,mid+1,right);
        arbint[node]=max(arbint[2*node],arbint[2*node+1]);
    }
}

void query(int node,int left,int right)
{
    int mid;
    if(arbint[node]==0)
    {
        maxi+=(right-left+1);
        ans=max(maxi,ans);
    }
    else if(left==right)
        maxi=0;
    else
    {
        mid=(left+right)/2;
        query(2*node,left,mid);
        query(2*node+1,mid+1,right);
    }
}

int main()
{
    freopen("hotel.in","r",stdin);
    freopen("hotel.out","w",stdout);
    int p,n,m,i;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d",&p);
        if(p==1)
        {
            scanf("%d%d",&x,&y);
            y=x+y-1;
            t=1;
            update(1,1,n);
        }
        else if(p==2)
        {
            scanf("%d%d",&x,&y);
            y=x+y-1;
            t=0;
            update(1,1,n);
        }
        else
        {
            maxi=0;
            ans=0;
            query(1,1,n);
           printf("%d\n",ans);
        }
    }
    return 0;
}