/* -*- coding: utf-8 -*-
 *
 * 3094.cc:  No.3094 Stapler - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<tuple>

using namespace std;

/* constant */

const int MAX_N = 1000000;
const int MAX_QN = 100000;
const int INF = 1 << 30;

/* typedef */

using tp3 = tuple<int,int,int>;

struct Elm {
  int x, c;
  Elm(): x(), c() {}
  Elm(int _x, int _c): x(_x), c(_c) {}

  Elm &operator+=(int d) { x += d; return *this; }
  Elm operator+(const Elm &e) const {
    if (x < e.x) return *this;
    if (x > e.x) return e;
    return Elm(x, c + e.c);
  }

  int count(int y) const { return (x == y) ? c : 0; }
};

template <typename T>
struct SegTreeSumDelay {
  int e2;
  vector<T> nodes;
  T defv;
  vector<int> dls;
  SegTreeSumDelay() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
    dls.assign(e2 * 2, 0);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }

  void __update(int k) {
    if (dls[k] != 0) {
      int k0 = k * 2 + 1, k1 = k0 + 1;
      nodes[k0] += dls[k];
      nodes[k1] += dls[k];
      dls[k0] += dls[k];
      dls[k1] += dls[k];
      dls[k] = 0;
    }
  }

  void add_range(int r0, int r1, int v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] += v;
      dls[k] += v;
      return;
    }

    __update(k);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    add_range(r0, r1, v, k0, i0, im);
    add_range(r0, r1, v, k1, im, i1);
    nodes[k] = nodes[k0] + nodes[k1];
  }
  void add_range(int r0, int r1, int v) { add_range(r0, r1, v, 0, 0, e2); }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    __update(k);

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

tp3 ops[MAX_QN];
SegTreeSumDelay<Elm> st;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);

  for (int i = 0; i < qn; i++) {
    int op, l = -1, r = -1;
    scanf("%d", &op);
    if (op == 1) scanf("%d%d", &l, &r), l--, r--;
    else if (op == 2) scanf("%d", &l), l--;
    ops[i] = {op, l, r};
  }

  st.init(n, Elm(INF, 0));
  for (int i = 0; i < n - 1; i++) st.seti(i, Elm(0, 1));
  st.setall();

  for (int i = 0; i < qn; i++) {
    auto [op, l, r] = ops[i];

    if (op == 1) {
      st.add_range(l, r, 1);
    }
    else if (op == 2) {
      auto [opj, lj, rj] = ops[l];
      st.add_range(lj, rj, -1);
    }
    else {
      auto e = st.sum_range(0, n - 1);
      printf("%d\n", e.count(0) + 1);
    }

    //for (int i = 0; i < n - 1; i++) printf("%d", st.sum_range(i, i + 1).x);
    //putchar('\n');
  }
  
  return 0;
}