#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct S {
	int val;
	int count;
};
S op(S sl, S sr) {
	if (sl.val > sr.val)return sr;
	else if (sl.val < sr.val)return sl;
	return { sl.val,sr.count + sl.count };
}
S e() { return S{ INF, 0 }; }
S mapping(int f, S x) { return{ x.val + f,x.count }; }
int composition(int f, int g) { return f + g; }
int id() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<S>v(n - 1, { 0,1 });
	lazy_segtree<S, op, e, int, mapping, composition, id> seg(v);
	vector<P>que(q);
	rep(i, q) {
		int t; cin >> t;
		if (t == 1) {
			int l, r; cin >> l >> r;
			l--, r--;
			seg.apply(l, r, 1);
			que[i] = { l,r };
		}
		else if (t == 2) {
			int idx; cin >> idx;
			idx--;
			seg.apply(que[idx].first, que[idx].second, -1);
		}
		else {
			auto get = seg.all_prod();
			if (get.val == 0) {
				cout << get.count + 1 << endl;
			}
			else {
				cout << 1 << endl;
			}
		}
	}
	return 0;
}