#include <fstream>
#include <iostream>
using namespace std;

ifstream fin("hotel.in");
ofstream fout("hotel.out");

int n,m,c,i,j,cnt,stop;
struct aint{
    int cnt;
    int st;
    int dr;
    int lazy;
} a[400000];

void build(int nod, int st, int dr){
    if(st==dr){
        a[nod].cnt=1;
        a[nod].st=1;
        a[nod].dr=1;
        return;
    }


    int mid=(st+dr)/2;
    build(2*nod,st,mid);
    build(2*nod+1,mid+1,dr);

    a[nod].dr=a[nod].st=a[nod].cnt=a[2*nod].cnt+a[2*nod+1].cnt;
}

void upd(int nod, int st, int dr){
//    cout<<st<<" "<<dr<<" "<<i<<" "<<j<<"\n";
//
//    if(++stop==20)
//        return;

    if(i<=st && dr<=j){
        if(st==dr){
            if(c==2){
                a[nod].cnt=a[nod].st=a[nod].dr=1;
                a[nod].lazy=0;
            }else{
                a[nod].cnt=a[nod].st=a[nod].dr=0;
                a[nod].lazy=0;
            }
        }else{
            if(c==2){
                a[nod].st=a[nod].dr=a[nod].cnt=dr-st+1;
                a[nod].lazy=1;
            }else{
                a[nod].st=a[nod].dr=a[nod].cnt=0;
                a[nod].lazy=-1;
            }
        }

        return;
    }

    int mid=(st+dr)/2;
    if(a[nod].lazy==1){
        a[2*nod].cnt=a[2*nod].st=a[2*nod].dr=mid-st+1;
        a[2*nod].lazy=1;

        a[2*nod+1].cnt=a[2*nod+1].st=a[2*nod+1].dr=dr-mid;
        a[2*nod+1].lazy=1;
    }

    if(a[nod].lazy==-1){
        a[2*nod].st=a[2*nod].dr=a[2*nod].cnt=0;
        a[2*nod].lazy=-1;

        a[2*nod+1].st=a[2*nod+1].dr=a[2*nod+1].cnt=0;
        a[2*nod+1].lazy=-1;
    }
    a[nod].lazy=0;


    if(i<=mid)
        upd(2*nod,st,mid);
    if(j>mid)
        upd(2*nod+1,mid+1,dr);

    a[nod].cnt=max( max(a[2*nod].cnt ,a[2*nod+1].cnt), a[2*nod].dr+a[2*nod+1].st );

    a[nod].st=a[2*nod].st;
    if(a[2*nod].cnt == mid-st+1)
        a[nod].st+=a[2*nod+1].st;

    a[nod].dr=a[2*nod+1].dr;
    if(a[2*nod+1].cnt == dr-mid)
        a[nod].dr+=a[2*nod].dr;
}

int main(){
    fin>>n>>m;
    build(1,1,n);

    for(;m;m--){
        fin>>c;

        if(c==1){
            fin>>i>>j;
            j=i+j-1;
            upd(1,1,n);
        }

        if(c==2){
            fin>>i>>j;
            j=i+j-1;
            upd(1,1,n);
        }

        if(c==3){
            fout<<a[1].cnt<<"\n";
        }
    }

    return 0;
}