// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

#include<atcoder/lazysegtree>
using namespace atcoder;

struct S{
    ll val;
    ll cnt;
};
S op(S l, S r){
    if(l.val == r.val) return {l.val, l.cnt + r.cnt};
    if(l.val > r.val) return r;
    return l;
}
S e(){return {INF, 0};}
S cp(ll l, S r){
    return {r.val+l, r.cnt};
}
ll mp(ll l, ll r){return l+r;}
ll id(){return 0;}


void solve(){
    ll n,q;
    cin >> n >> q;
    V<pair<ll,ll>> v(q);
    V<S> vv(n);
    rep(i,n) vv[i] = {0, 1};
    lazy_segtree<S,op,e,ll,cp,mp,id> seg(vv);
    rep(i, q){
        ll t;
        cin >> t;
        if(t==1){
            ll l,r;
            cin >> l >> r;
            v[i] = {l,r};
            if(l<r) seg.apply(l, r, 1);
        }else if(t==2){
            ll k;
            cin >> k;
            k--;
            auto[l,r] = v[k];
            if(l<r) seg.apply(l, r, -1);
        }else{
            S ans = seg.all_prod();
            cout << ans.cnt << endl;
        }
    }
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}