#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

// 区間加算・区間最小値と最小値の個数クエリ
struct S{
    ll min_val;
    ll min_cnt;
};

S op(S a, S b){
    ll min_v = min(a.min_val, b.min_val);
    ll min_c = 0;
    if (min_v == a.min_val) min_c += a.min_cnt;
    if (min_v == b.min_val) min_c += b.min_cnt;
    
    return S{min_v, min_c};
}

ll INF = 100000000023LL;

S e(){
    return S{INF, 0};
}

S mapping(ll f, S x){
    return S{x.min_val + f, x.min_cnt};
}

ll composition(ll f, ll g){
    return f + g;
}

ll id(){
    return 0LL;
}

int main() {
    ll N;
    cin >> N;
    ll Q;
    cin >> Q;
    vector<ll> L(Q, -1);
    vector<ll> R(Q, -1);

    lazy_segtree<S, op, e, ll, mapping, composition, id> seg(N - 1);
    rep(i, N - 1) seg.set(i, S{0, 1});

    // 紙のまとまりの枚数をどうにかして保持できないか？
    for (ll i = 0; i < Q; i++){
        ll type;
        cin >> type;
        if (type == 1){
            cin >> L[i] >> R[i];
            L[i]--;
            R[i]--;
            seg.apply(L[i], R[i], 1);
        }
        else if (type == 2){
            ll q;
            cin >> q;
            q--;
            seg.apply(L[q], R[q], -1);
        }
        else{
            S pd = seg.all_prod();
            if (pd.min_val == 0) cout << pd.min_cnt + 1 << endl;
            else cout << 1 << endl;
        }
    }
}