#include <bits/stdc++.h>

using namespace std;

ifstream fin ("hotel.in");
ofstream fout ("hotel.out");

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

struct solve
{
    int ans, mx_left, mx_right;
} tree[N * 4];

int lazy[N * 4];

void build(int left, int right, int node)
{
    if(left > right) {
        return ;
    }
    if(left == right) {
        tree[node].ans = 1;
        tree[node].mx_left = 1;
        tree[node].mx_right = 1;
        return ;
    }
    int mid = (left + right) >> 1;
    build(left, mid, node * 2);
    build(mid + 1, right, node * 2 + 1);
    tree[node].mx_left = right - left + 1;
    tree[node].mx_right = right - left + 1;
    tree[node].ans = right - left + 1;
}

void update(int left, int right, int node, int x, int y, int type)
{
    if(lazy[node] != 0) {
        if(lazy[node] == 1) {
            tree[node].mx_left = (right - left + 1);
            tree[node].mx_right = (right - left + 1);
            tree[node].ans = (right - left + 1);
        }
        else {
            tree[node].mx_left = 0;
            tree[node].mx_right = 0;
            tree[node].ans = 0;
        }
        if(left != right) {
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        lazy[node] = 0;
    }
    if(left > right || left > y || right < x) return ;
    if(left >= x && right <= y) {
        if(type == 1) {
            tree[node].mx_left = (right - left + 1);
            tree[node].mx_right = (right - left + 1);
            tree[node].ans = (right - left + 1);
        }
        else {
            tree[node].mx_left = 0;
            tree[node].mx_right = 0;
            tree[node].ans = 0;
        }
        if(left != right) {
            lazy[node * 2] = type;
            lazy[node * 2 + 1] = type;
        }
        return ;
    }
    int mid = (left + right) >> 1;
    update(left, mid, node * 2, x, y, type);
    update(mid + 1, right, node * 2 + 1, x, y, type);
    tree[node].ans = max(tree[node * 2].ans, tree[node * 2 + 1].ans);
    tree[node].ans = max(tree[node].ans, tree[node * 2].mx_right + tree[node * 2 + 1].mx_left);
    tree[node].mx_left = tree[node * 2].mx_left;
    tree[node].mx_right = tree[node * 2 + 1].mx_right;
    if(tree[node * 2].mx_left == mid - left + 1) {
        tree[node].mx_left += tree[node * 2 + 1].mx_left;
    }
    if(tree[node * 2 + 1].mx_right == right - mid) {
        tree[node].mx_right += tree[node * 2].mx_right;
    }
}

int query(int left, int right, int node, int x, int y)
{
    if(left > right || left > y || right < x) return 0;
    if(lazy[node] != 0) {
        if(lazy[node] == 1) {
            tree[node].mx_left = (right - left + 1);
            tree[node].mx_right = (right - left + 1);
            tree[node].ans = (right - left + 1);
        }
        else {
            tree[node].mx_left = 0;
            tree[node].mx_right = 0;
            tree[node].ans = 0;
        }
        if(left != right) {
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        lazy[node] = 0;
    }
    if(left >= x && right <= y) {
        return tree[node].ans;
    }
    int mid = (left + right) >> 1;
    int ans1 = 0, ans2 = 0;
    ans1 = query(left, mid, node * 2, x, y);
    ans2 = query(mid + 1, right, node * 2 + 1, x, y);
    return max(ans1, ans2);
}

int main()
{
    usain_bolt();

    int n, m;

    fin >> n >> m;
    build(1, n, 1);
    for(int i = 1; i <= m; ++i) {
        int type, a, b;

        fin >> type;
        if(type == 3) {
            fout << query(1, n, 1, 1, n) << "\n";
        }
        else {
            int a, b;

            fin >> a >> b;
            if(type == 1) {
                update(1, n, 1, a, a + b - 1, -1);
            }
            else {
                update(1, n, 1, a, a + b - 1, 1);
            }
        }
    }
    return 0;
}