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

typedef struct lol {
        int x,y,rs;
}troll;

int n,q,x,y,op,aux;
troll arb[400005];

void build(int left,int right,int nod) {
     if(left==right) arb[nod].x=arb[nod].y=arb[nod].rs=1;
     else {
            arb[nod].x=arb[nod].y=arb[nod].rs=right-left+1;
            int pivot=(left+right)/2;
            build(left,pivot,2*nod);
            build(pivot+1,right,2*nod+1);
          }
}

void update(int left,int right,int nod) {
     if(x<=left && right<=y) arb[nod].x=arb[nod].y=arb[nod].rs=(op==2) ? 1:0;
     else {
            int pivot=(left+right)/2;
            if(!arb[nod].rs) {
              arb[2*nod].x=arb[2*nod].y=arb[2*nod].rs=0;
              arb[2*nod+1].x=arb[2*nod+1].y=arb[2*nod+1].rs=0;
            }
            if(arb[nod].rs==right-left+1) {
              arb[2*nod].x=arb[2*nod].y=arb[2*nod].rs=pivot-left+1;
              arb[2*nod+1].x=arb[2*nod+1].y=arb[2*nod+1].rs=right-pivot;
            }

            if(x<=pivot) update(left,pivot,2*nod);
            if(pivot<y) update(pivot+1,right,2*nod+1);

            arb[nod].rs=max(arb[2*nod].rs,arb[2*nod+1].rs);
            arb[nod].rs=max(arb[nod].rs,arb[2*nod].y+arb[2*nod+1].x);
            arb[nod].x=arb[2*nod].x;
            arb[nod].y=arb[2*nod+1].y;
            if(arb[2*nod].x==pivot-left+1) arb[nod].x+=arb[2*nod+1].x;
            if(arb[2*nod+1].y==right-pivot) arb[nod].y+=arb[2*nod].y;
          }
}

int main()
{
  ifstream cin("hotel.in");
  ofstream cout("hotel.out");

  cin>>n>>q;
  build(1,n,1);

  while(q--)
  {
    cin>>op;
    if(op==3) cout<<arb[1].rs<<'\n';
    else cin>>x>>y,y=x+y-1,update(1,n,1);
  }

 return 0;
}