#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

struct S {
  int mn, cnt;
};
S op(S x, S y) {
  if (x.mn < y.mn) return x;
  else if (x.mn > y.mn) return y;
  else return {x.mn, x.cnt + y.cnt};
}
S e() { return {0, 0}; }
int composition(int f, int g) { return f + g; }
int id() { return 0; }
S mapping(int f, S x) { return {x.mn + f, x.cnt}; }


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  lazy_segtree<S, op, e, int, mapping, composition, id> seg(vector<S>(n - 1, S{0, 1}));
  int q;
  cin >> q;
  vector<P> memo(q);
  rep(i, q) {
    int type;
    cin >> type;
    if (type == 1) {
      int l, r;
      cin >> l >> r;
      l--, r--;
      seg.apply(l, r, 1);
      memo[i] = {l, r};
    } else if (type == 2) {
      int q;
      cin >> q;
      q--;
      auto [l, r] = memo[q];
      seg.apply(l, r, -1);
    } else {
      cout << op(seg.all_prod(), e()).cnt + 1 << '\n';
    }
  }
}