#include <bits/stdc++.h>
#define INF 1000000000
#define ll long long int
using namespace std;
struct SegmentTree
{
    int pref,suf,vmax,lazy;
};
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
SegmentTree aint[800009];
void build(int nod,int st,int dr)
{
    if(st==dr)
    {
        aint[nod].pref=aint[nod].suf=aint[nod].vmax=1;
        return ;
    }
    int mij=(st+dr)/2;
    build(2*nod,st,mij);
    build(2*nod+1,mij+1,dr);
    aint[nod].pref=aint[nod].suf=aint[nod].vmax=aint[2*nod].vmax+aint[2*nod+1].vmax;
}
void update(int nod,int st,int dr,int tip,int ql,int qr)
{
    //cout<<nod<<" ";
    if(st>dr) return;
    if(aint[nod].lazy==1)
    {
        aint[nod].pref=0;
        aint[nod].suf=0;
        aint[nod].vmax=0;
        if(st!=dr)
        {
            aint[2*nod].lazy=aint[2*nod+1].lazy=1;

        }
        aint[nod].lazy=-1;
    }
    else
    {
        if(aint[nod].lazy==0)
        {
            aint[nod].suf=dr-st+1;
            aint[nod].pref=dr-st+1;
            aint[nod].vmax=dr-st+1;
            if(st!=dr)
            {
                 aint[2*nod].lazy=aint[2*nod+1].lazy=0;
            }
            aint[nod].lazy=-1;
        }
    }
    if(st>qr||dr<ql) return;
    if(ql<=st&&dr<=qr)
    {
        if(tip==1)
        {
            aint[nod].pref=aint[nod].suf=aint[nod].vmax=0;
            if(st!=dr)
            {
                aint[2*nod].lazy=aint[2*nod+1].lazy=1;
            }
        }
        else
        {
            aint[nod].suf=dr-st+1;
            aint[nod].pref=dr-st+1;
            aint[nod].vmax=dr-st+1;
            if(st!=dr)
            {
                aint[2*nod].lazy=aint[2*nod+1].lazy=0;
            }
        }
        return;
    }
    int mij=(st+dr)/2;
    update(2*nod,st,mij,tip,ql,qr);
    update(2*nod+1,mij+1,dr,tip,ql,qr);
    aint[nod].vmax=max(aint[2*nod].vmax,aint[2*nod+1].vmax);
    aint[nod].vmax=max(aint[nod].vmax,aint[2*nod].suf+aint[2*nod+1].pref);
    aint[nod].pref=aint[2*nod].pref;
    aint[nod].suf=aint[2*nod+1].suf;
    if(aint[2*nod].vmax==mij-st+1) aint[nod].pref+=aint[2*nod+1].pref;
    if(aint[2*nod+1].vmax==dr-mij) aint[nod].suf+=aint[2*nod].suf;


}
int query()
{
    return aint[1].vmax;
}

int n,q;
int main()
{
InParser f("hotel.in");
OutParser g("hotel.out");
    f>>n>>q;
    build(1,1,n);

    for(int i=1;i<=q;i++)
    {

        int tip;
        f>>tip;
        if(tip==3) g<<query()<<'\n';
        else
        {
            int st,dr;
            f>>st>>dr;
            dr=st+dr-1;

             update(1,1,n,tip,st,dr);

        }
    }

}