#include <fstream>
#include <iostream>

using namespace std;

const int MAXN = 100005;

int arb[4 * MAXN], room[MAXN];
int n;

void ocup(int nod, int st, int dr, int a, int b){
    if(a <= st && dr <= b){
        arb[nod] = 1;
        for(int i = st; i <= dr; ++i)
            room[i] = 1;
        return;
    }
    int mij = (st + dr) / 2;
    if(a <= mij)
        ocup(2 * nod, st, mij, a, b);
    if(b > mij)
        ocup(2 * nod + 1, mij + 1, dr, a, b);
}

void elib(int nod, int st, int dr, int a, int b){
    if(a <= st && dr <= b){
        arb[nod] = 0;
        for(int i = st; i <= dr; ++i)
            room[i] = 0;
        return;
    }
    int mij = (st + dr) / 2;
    if(a <= mij)
        elib(2 * nod, st, mij, a, b);
    if(b > mij)
        elib(2 * nod + 1, mij + 1, dr, a, b);
}

int counter(){
    int cnt = 0, maxlen = 0;
    for(int i = 1; i <= n; ++i){
        if(!room[i])
            cnt++;
        else{
            maxlen = max(maxlen, cnt);
            cnt = 0;
        }
    }
    maxlen = max(maxlen, cnt);
    return maxlen;
}

int main()
{
    ifstream fin("hotel.in");
    ofstream fout("hotel.out");
    int p, op, st, len;
    fin >> n >> p;
    for(int t = 1; t <= p; ++t){
        fin >> op;
        if(op == 1){
            fin >> st >> len;
            ocup(1, 1, n, st, st + len - 1);
        }
        else if(op == 2){
            fin >> st >> len;
            elib(1, 1, n, st, st + len - 1);
        }
        else
            fout << counter() << "\n";
    }
    return 0;
}