#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
struct node {
    int l, r, total;
}auxNode;
vector<node> t;
int N, M, c, a, b, sosireSauPlecare;

void Build(int node, int left, int right);
void Push(int node, int left, int right);
void UpdateSegment(int node, int left, int right);
void Solve();
void Prepare();

int main()
{
    Prepare();
    Solve();
    return 0;
}
void Prepare()
{
    freopen("hotel.in", "rt", stdin);
    freopen("hotel.out", "wt", stdout);
    scanf("%d%d", &N, &M);
    t.assign(4*N, auxNode);
    Build(1, 1, N);
}
void Solve()
{
    for(int i=1; i<=M; ++i) {
        scanf("%d", &c);
        if(c == 3)
            cout<<t[1].total<<'\n';
        else {
            scanf("%d%d", &a, &b);
            b += a - 1;
            sosireSauPlecare = c - 1;                       //0 = sosire; 1 = plecare;
            UpdateSegment(1, 1, N);
        }
    }
}
void Build(int node, int left, int right)
{
    t[node].l = t[node].r = t[node].total = right - left + 1;
    if(left == right)
        return;
    int mid = (right + left)>>1;
    Build(node << 1, left, mid);
    Build( (node << 1) + 1, mid + 1, right);
}
void Push(int node, int left, int right)
{
    if (!t[node].total) {
        t[node << 1].l = t[node << 1].r = t[node << 1].total = 0;
        t[(node << 1)+ 1].l = t[(node << 1)+ 1].r = t[(node << 1)+ 1].total = 0;
        return;
    }
    if(t[node].total == right - left + 1) {
        int mid = (right + left)>>1;
        t[node << 1].l = t[node << 1].r = t[node << 1].total = mid - left + 1;
        t[(node << 1)+ 1].l = t[(node << 1)+ 1].r = t[(node << 1)+ 1].total = right - mid;
    }
}
void UpdateSegment(int node, int left, int right)
{
    if(a <= left && right <= b) {
        t[node].l = t[node].r = t[node].total = sosireSauPlecare * (right - left + 1);
        return;
    }
    if(left >= right)
        return;
    Push(node, left, right);
    int mid = (right + left)>>1;;
    if(a <= mid)
        UpdateSegment(node << 1, left, mid);
    if(b > mid)
        UpdateSegment((node << 1)+ 1, mid + 1, right);

    t[node].l = t[node << 1].l;
    if(t[node << 1].l == mid - left + 1)
        t[node].l +=t[(node << 1)+ 1].l;

    t[node].r = t[(node << 1)+ 1].r;
    if(t[(node << 1)+ 1].r == right - mid)
        t[node].r += t[node << 1].r;
    t[node].total = t[node << 1].r + t[(node << 1)+ 1].l;
    t[node].total = max( t[node].total, max(t[node << 1].total, t[(node << 1)+ 1].total) );
}