#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 5;

mt19937 rnd;

struct Node {
    int ls, rs, fa, mn, siz;
    unsigned int key;
} p[N];

int rt;

void pushup(int k) {
    p[k].mn = min({p[p[k].ls].mn, p[p[k].rs].mn, k});
    p[k].siz = p[p[k].ls].siz + p[p[k].rs].siz + 1;
}

void split(int k, int x, int &a, int &b) {
    if (!k) {
        a = b = 0;
        return;
    }
    if (p[p[k].ls].siz + 1 <= x) {
        a = k, p[p[k].rs].fa = 0, split(p[k].rs, x - (p[p[k].ls].siz + 1), p[a].rs, b);
        if (p[k].rs) p[p[k].rs].fa = k;
    } else {
        b = k, p[p[k].ls].fa = 0, split(p[k].ls, x, a, p[b].ls);
        if (p[k].ls) p[p[k].ls].fa = k;
    }
    pushup(k);
}

int merge(int x, int y) {
    if (!x || !y) return x + y;
    if (p[x].key < p[y].key) {
        p[p[x].rs].fa = 0;
        p[x].rs = merge(p[x].rs, y);
        if (p[x].rs) p[p[x].rs].fa = x;
        pushup(x);
        return x;
    }
    p[p[y].ls].fa = 0;
    p[y].ls = merge(x, p[y].ls);
    if (p[y].ls) p[p[y].ls].fa = y;
    pushup(y);
    return y;
}

int rnk(int x) {
    int res = p[p[x].ls].siz + 1;
    while (x != rt) {
        if (p[p[x].fa].rs == x) res += p[p[p[x].fa].ls].siz + 1;
        x = p[x].fa;
    }
    return res;
}

signed main() {
    int n, m = 0; scanf("%*d%d", &n);
    p[0].mn = n + 1;
    for (int i = 1; i <= n; ++i) {
        int opt, x; scanf("%d%d", &opt, &x);
        if (opt == 1) {
            ++m, p[m].mn = m, p[m].siz = 1, p[m].key = rnd();
            if (x) x = rnk(x);
            int a, b;
            split(rt, x, a, b);
            rt = merge(merge(a, m), b);
        } else if (opt == 2) {
            int y; scanf("%d", &y);
        } else {
            printf("%d\n", rnk(x));
        }
    }
    return 0;
}