#include <fstream>
using namespace std;
ifstream cin("hotel.in");
ofstream cout("hotel.out");
const int nmax = 2e5 + 5;
struct ptaint
{
int st, dr, maxx;
};
ptaint aint[4 * nmax];
int lazy[4 * nmax];
void push_lazy(int node, int st, int dr)
{
if(lazy[node] != -1){
if(lazy[node]){
aint[node] = {0, 0, 0};
if(st != dr)
lazy[node * 2] = lazy[node * 2 + 1] = 1;
}
else{
aint[node] = {dr - st + 1, dr - st + 1, dr - st + 1};
if(st != dr)
lazy[node * 2] = lazy[node * 2 + 1] = 0;
}
}
lazy[node] = -1;
}
void update(int node, int st, int dr, int l, int r, int val)
{
push_lazy(node, st, dr);
if(st > r or dr < l)
return;
if(l <= st and dr <= r){
lazy[node] = val;
push_lazy(node, st, dr);
return;
}
int mid = (st + dr) / 2;
update(node * 2, st, mid, l, r, val);
update(node * 2 + 1, mid + 1, dr, l, r, val);
if(aint[node * 2].st == (mid - st + 1))
aint[node].st = aint[node * 2].st + aint[node * 2 + 1].st;
else
aint[node].st = aint[node * 2].st;
if(aint[node * 2 + 1].dr == (dr - mid))
aint[node].dr = aint[node * 2].dr + aint[node * 2 + 1].dr;
else
aint[node].dr = aint[node * 2 + 1].dr;
aint[node].maxx = max(max(aint[node * 2].maxx, aint[node * 2 + 1].maxx), aint[node * 2].dr + aint[node * 2 + 1].st);
}
int main()
{
int n, q;
cin >> n >> q;
for(int i = 1; i <= 4 * n; i++)
lazy[i] = -1;
//for(int i = 1; i <= n; i++)
update(1, 1, n, 1, n, 0);
while(q--){
int tip;
cin >> tip;
if(tip == 1){
int poz, size;
cin >> poz >> size;
update(1, 1, n, poz, poz + size - 1, 1);
}
else if(tip == 2){
int poz, size;
cin >> poz >> size;
update(1, 1, n, poz, poz + size - 1, 0);
}
else{
cout << aint[1].maxx << "\n";
}
}
}