#include <bits/stdc++.h>
#include<atcoder/lazysegtree>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

struct S{
  int m,cnt;
};

S seg_e(){
  return S{(int)1e9,0};
}

S seg_op(S a,S b){
  if(a.m==b.m){
    return S{a.m,a.cnt+b.cnt};
  }else if(a.m<b.m){
    return a;
  }else{
    return b;
  }
}

S seg_map(int f,S a){
  a.m+=f;
  return a;
}
int seg_id(){
  return 0;
}
int seg_comp(int g,int f){
  return f+g;
}

int main(){
  int N;
  cin>>N;
  atcoder::lazy_segtree<S,seg_op,seg_e,int,seg_map,seg_comp,seg_id> seg(N);
  rep(i,N-1){
    seg.set(i,S{0,1});
  }
  int Q;
  cin>>Q;
  map<int,array<int,2>> memo;
  rep(i,1,Q+1){
    int op;
    cin>>op;
    if(op==1){
      int L,R;
      cin>>L>>R;
      --L,--R;
      seg.apply(L,R,1);
      memo[i]=array<int,2>{L,R};
    }else if(op==2){
      int q;
      cin>>q;
      auto [L,R]=memo[q];
      seg.apply(L,R,-1);
      memo[q]={0,0};
    }else{
      S a=seg.prod(0,N);
      if(a.m==0)cout<<a.cnt+1<<'\n';
      else cout<<"1\n";
    }
  }
}