#include<fstream>
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
using namespace std;
ifstream in("hotel.in");
ofstream out("hotel.out");
const int Nmax = 100005;
int N,P;
struct nod{
int val;
int left,right;
int maxl;
int size;
int refresh;
} A[20*Nmax];
void Preset(int st,int dr,int i){
A[i].left = A[i].right = A[i].maxl = A[i].val = A[i].size = dr-st+1;
A[i].refresh = 0;
if( st<dr ){
int mij=(st+dr)/2;
Preset(st,mij,2*i);
Preset(mij+1,dr,2*i+1);
}
}
void Refresh(int i){
if( A[i].refresh ){
if( A[i].refresh == 1 ) A[i].val = A[i].left = A[i].right = A[i].maxl = 0;
if( A[i].refresh == 2 ) A[i].val = A[i].left = A[i].right = A[i].maxl = A[i].size;
A[2*i].refresh = A[i].refresh;
A[2*i+1].refresh = A[i].refresh;
A[i].refresh=0;
}
}
void Update1(int sto,int dro,int st,int dr,int i){
Refresh(i);
A[i].val -= dro-sto+1;
if( A[i].val != 0 ){
int mij=(st+dr)/2;
if(sto<=mij && dro>mij){
Update1(sto,mij,st,mij,2*i);
Update1(mij+1,dro,mij+1,dr,2*i+1);
}
else if(dro<=mij){
Update1(sto,dro,st,mij,2*i);
}
else{
Update1(sto,dro,mij+1,dr,2*i+1);
}
Refresh(2*i);
Refresh(2*i+1); // while my node is lazy I cannot retrieve information from it
if( A[2*i].val == A[2*i].size ) A[i].left = A[2*i].size + A[2*i+1].left;
else A[i].left = A[2*i].left;
if( A[2*i+1].val == A[2*i+1].size ) A[i].right = A[2*i+1].size + A[2*i].right;
else A[i].right = A[2*i+1].right;
A[i].maxl = max( max(A[2*i].maxl,A[2*i+1].maxl) , A[2*i].right+A[2*i+1].left );
}
else{
A[i].left = A[i].right = A[i].maxl = 0;
A[2*i].refresh = 1;
A[2*i+1].refresh = 1;
}
}
void Update2(int sto,int dro,int st,int dr,int i){
Refresh(i);
A[i].val += dro-sto+1;
if( A[i].val != A[i].size ){
int mij=(st+dr)/2;
if(sto<=mij && dro>mij){
Update2(sto,mij,st,mij,2*i);
Update2(mij+1,dro,mij+1,dr,2*i+1);
}
else if(dro<=mij){
Update2(sto,dro,st,mij,2*i);
}
else{
Update2(sto,dro,mij+1,dr,2*i+1);
}
Refresh(2*i);
Refresh(2*i+1);
if( A[2*i].val == A[2*i].size ) A[i].left = A[2*i].size + A[2*i+1].left;
else A[i].left = A[2*i].left;
if( A[2*i+1].val == A[2*i+1].size ) A[i].right = A[2*i+1].size + A[2*i].right;
else A[i].right = A[2*i+1].right;
A[i].maxl = max( max(A[2*i].maxl,A[2*i+1].maxl) , A[2*i].right+A[2*i+1].left );
}
else{
A[i].left = A[i].right = A[i].maxl = A[i].size;
A[2*i].refresh = 2;
A[2*i+1].refresh = 2;
}
}
void afisare(){
for(int i=1;i<= 4*12 ;i++){
out<<A[i].val<<' ';
out<<A[i].size<<' ';
out<<A[i].maxl<<' ';
out<<A[i].left<<' ';
out<<A[i].right<<' ';
out<<" ";
}
out<<'\n';
}
int main(){
in>>N>>P;
Preset(1,N,1);
for(int i=1;i<=P;i++){
int c,a,b,s;
in>>c;
if(c==1){
in>>a>>s;
b=a+s-1;
Update1(a,b,1,N,1);//afisare();
}
if(c==2){
in>>a>>s;
b=a+s-1;
Update2(a,b,1,N,1);//afisare();
}
if(c==3){
out<< A[1].maxl <<'\n';
}
}
return 0;
}