#include <bits/stdc++.h>
#define int long long
#define cin ci
#define cout co
using namespace std;
ifstream cin("hotel.in");
ofstream cout("hotel.out");
const int nmax = 1e5;
int n, m;
struct TreeNode
{
    int seg, pref, suf, siz;
    friend TreeNode operator + (const TreeNode & a, const TreeNode & b)
    {
        TreeNode node;

        node.seg = max(a.seg, b.seg);

        if(a.suf != 0 && b.pref != 0)
            node.seg = max(node.seg, a.suf + b.pref);

        node.siz = a.siz + b.siz;

        node.pref = a.pref;
        if(a.pref == a.siz)
            node.pref = a.siz + b.pref;

        node.suf = b.suf;
        if(b.suf == b.siz)
            node.suf = b.siz + a.suf;

        return node;
    }
};
TreeNode tree[4 * nmax + 5];
int lazy[4 * nmax + 5];
void build(int node, int left, int right)
{
    if(left == right)
    {
        tree[node] = {1, 1, 1, 1};
        return;
    }

    int mij = (left + right) / 2;

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

    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
void propagate(int node, int left, int right)
{
    if(lazy[node] == 2)
        return;

    if(lazy[node] == 1)
        tree[node] = {0, 0, 0, right - left + 1};
    else
        tree[node] = {right - left + 1, right - left + 1, right - left + 1, right - left + 1};

    if(left != right)
    {
        lazy[2 * node] = lazy[node];
        lazy[2 * node + 1] = lazy[node];
    }

    lazy[node] = 2;
}
void update(int node, int left, int right, int start, int fin, int val)
{
    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, start, fin, val);

    if(mij < fin)
        update(2 * node + 1, mij + 1, right, start, fin, val);

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

    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int32_t main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> n >> m;
    build(1, 1, n);
    for(int i = 1; i <= 4 * nmax + 4; i ++)
        lazy[i] = 2;
    while(m --)
    {
        int c;
        cin >> c;
        if(c == 1)
        {
            int pos, nmb;
            cin >> pos >> nmb;
            update(1, 1, n, pos, pos + nmb - 1, 1);
        }
        else if(c == 2)
        {
            int pos, nmb;
            cin >> pos >> nmb;
            update(1, 1, n, pos, pos + nmb - 1, 0);
        }
        else
        {
            propagate(1, 1, n);
            cout << tree[1].seg << '\n';
        }
    }
    return 0;
}