#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#define maxn 100001
using namespace std;
ifstream fin("hotel.in");
ofstream fout("hotel.out");
int n, q;
int v[maxn*4];
struct str{
int lf, rt, bt;
};
str ait[maxn*4];
void upfill(int nod, int left, int right)
{
if(!v[nod]) return;
if(v[nod]==2)
{
int val=right-left+1;
ait[nod]={val, val, val};
if(left!=right)
{
v[2*nod]=v[2*nod+1]=v[nod];
}
v[nod]=0;
}
else
{
ait[nod]={0, 0, 0};
if(left!=right)
{
v[2*nod]=v[2*nod+1]=v[nod];
}
v[nod]=0;
}
}
void update(int nod, int left, int right, int qst, int qdr, int val)
{
int mid=(left+right)/2;
if(qst<=left&&right<=qdr)
{
v[nod]=val;
upfill(nod, left, right);
}
else
{
upfill(nod, left, right);
int mid=(left+right)/2;
if(qst<=mid)
{
update(2*nod, left, mid, qst, qdr, val);
}
else
{
upfill(2*nod, left, mid);
}
if(mid<qdr)
{
update(2*nod+1, mid+1, right, qst, qdr, val);
}
else
{
upfill(2*nod+1, mid+1, right);
}
if(ait[2*nod].lf==mid-left+1)
{
ait[nod].lf=ait[nod*2].lf+ait[nod*2+1].lf;
}
else
{
ait[nod].lf=ait[nod*2].lf;
}
if(ait[2*nod+1].rt==right-mid)
{
ait[nod].rt=ait[nod*2].rt+ait[2*nod+1].rt;
}
else
{
ait[nod].rt=ait[2*nod+1].rt;
}
ait[nod].bt=max(max(ait[2*nod].bt, ait[2*nod+1].bt),ait[nod*2].rt + ait[2*nod+1].lf);
}
}
int main()
{
int op, pos, m;
fin>>n>>q;
update(1, 1, n, 1, n, 2);
while(q--)
{
fin>>op;
if(op==3)
{
fout<<ait[1].bt<<'\n';
}
else
{
fin>>pos>>m;
update(1, 1, n, pos, m+pos-1, op);
}
}
return 0;
}