#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("hotel.in");
ofstream cout("hotel.out");
const int Nmax = 1e5 + 1;
int n, q, c, start, fin, val;
struct TreeNode
{
    int suf, pref, seg;

}tree[4 * Nmax];
int lazy[4 * Nmax];
void build(int node, int left, int right)
{
    if(left == right)
    {
        tree[node].pref = tree[node].suf = tree[node].seg = 1;
        return;
    }
    int mij = (left + right) / 2;
    build(2 * node, left, mij);
    build(2 * node + 1, mij + 1, right);
    tree[node].pref = tree[node].suf = tree[node].seg = right - left + 1;
}
void propagate(int node, int left, int right)
{
    if(!lazy[node])
        return;
    if(lazy[node] == 1)
        tree[node].pref = tree[node].suf = tree[node].seg = 0;
    else
        tree[node].pref = tree[node].suf = tree[node].seg = right - left + 1;
    if(left != right)
    {
        lazy[2 * node] = lazy[node];
        lazy[2 * node + 1] = lazy[node];
    }
    lazy[node] = 0;
}
void update(int node, int left, int right)
{
    propagate(node, left, right);
    if(start <= left && right <= fin)
    {
        lazy[node] = val;
        return;
    }
    int mij = (left + right) / 2;
    if(start <= mij)
        update(2 * node, left, mij);
    if(fin > mij)
        update(2 * node + 1, mij + 1, right);

    propagate(2 * node, left, mij);
    propagate(2 * node + 1, mij + 1, right);

    tree[node].seg = max({tree[2 * node].seg, tree[2 * node + 1].seg, tree[2 * node].suf + tree[2 * node + 1].pref});
    if(tree[2 * node].pref == mij - left + 1)
        tree[node].pref = tree[2 * node].pref + tree[2 * node + 1].pref;
    else
        tree[node].pref = tree[2 * node].pref;

    if(tree[2 * node + 1].suf == right - mij)
        tree[node].suf = tree[2 * node + 1].suf + tree[2 * node].suf;
    else
        tree[node].suf = tree[2 * node + 1].suf;

}
int main()
{
    cin >> n >> q;
    build(1, 1, n);
    while(q--)
    {
        cin >> c;
        if(c == 1)
        {
            cin >> start >> fin;
            fin += start - 1;
            val = 1;
            update(1, 1, n);
        }
        else
            if(c == 2)
            {
                cin >> start >> fin;
                fin += start - 1;
                val = -1;
                update(1, 1, n);
            }
            else
            {
                propagate(1, 1, n);
                cout << tree[1].seg << '\n';
            }
    }
    return 0;
}