#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ld long double
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define ass assign

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...)                                                                                     \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)b)-1; i>=(ll)(a); --i)
#define per4(i,a,b,c) for(ll i=((ll)b)-1; i>=(ll)(a); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=((ll)n); i>=1; --i)
#define per2e(i,n) for(ll i=((ll)n); i>=1; --i)
#define per3e(i,a,b) for(ll i=((ll)a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=((ll)a); i>=(ll)(b); i-=(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))
// #define forit(v) for (auto it = v.begin(); it != v.end(); it++)
// #define forit2(it, v) for (auto it = v.begin(); it != v.end(); it++)
// #define forrit(v) for (auto it = v.rbegin(); it != v.rend(); it++)
// #define forrit2(it, v) for (auto it = v.rbegin(); it != v.rend(); it++)

// #ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
// #else
// #define bug(...) 777771449
// #endif

const ll MOD = 1e9 + 7;
const long long INF = (1ll << 59);

const string FILENAME = "hotel";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

#define cin fin
#define cout fout

struct nodeData
{
	ll pref, suf, ans, sz;
	bool prop, marked;
	
	nodeData()
	{
		pref = 0;
		suf = 0;
		ans = 0;
		prop = 0;
		marked = 0;
		sz = 1;
	}
	void operator=(nodeData x)
	{
		pref = x.pref;
		suf = x.suf;
		ans = x.ans;
		prop = x.prop;
		marked = x.marked;
		sz = x.sz;
	}
	void comb(nodeData x, nodeData y)
	{
		ans = max({x.ans, y.ans, x.suf + y.pref});
		pref = x.pref;
		if(pref > 0 && x.pref == x.sz) pref += y.pref;
		suf = y.suf;
		if(suf > 0 && y.suf == y.sz) suf += x.suf;
		sz = x.sz + y.sz;
	}
};

class Hoshino
{
public:

	ll n;
	vec<nodeData> ai;
	
	void push(ll i, ll l, ll r)
	{
		if(!ai[i].marked || l == r) return;
		ll mid = (l+r)/2, rc = i+2*(mid-l+1);
		
		if(ai[i].prop == 0)
		{
			ai[i+1].pref = ai[i+1].suf = ai[i+1].ans = (mid-l+1);
			ai[rc].pref = ai[rc].suf = ai[rc].ans = (r-mid);
		}
		else
		{
			ai[i+1].pref = ai[i+1].suf = ai[i+1].ans = 0;
			ai[rc].pref = ai[rc].suf = ai[rc].ans = 0;
		}
		
		ai[i+1].marked = ai[rc].marked = 1;
		ai[i+1].prop = ai[rc].prop = ai[i].prop;
		ai[i].marked = 0;
	}
	void build(ll x)
	{
		n = x;
		ai.resize(2*n-1);
		build_(0, 0, n-1);
	}
	void build_(ll i, ll l, ll r)
	{
		if(l == r)
		{
			ai[i].pref = ai[i].suf = ai[i].ans = 1;
			return;
		}
		
		ll mid = (l+r)/2, rc = i+2*(mid-l+1);
		build_(i+1, l, mid);
		build_(rc, mid+1, r);
		
		ai[i].comb(ai[i+1], ai[rc]);
	}
	void updateOccupy(ll l, ll r)
	{
		updateOccupy_(0, 0, n-1, l, r);
	}
	void updateOccupy_(ll i, ll l, ll r, ll x, ll y)
	{
		if(x <= l && r <= y)
		{
			// bug(l, r);
			ai[i].prop = 1;
			ai[i].marked = 1;
			ai[i].pref = ai[i].suf = ai[i].ans = 0;
			return;
		}
		
		push(i, l, r);
		ll mid = (l+r)/2, rc = i+2*(mid-l+1);
		if(x <= mid) updateOccupy_(i+1, l, mid, x, y);
		if(mid < y) updateOccupy_(rc, mid+1, r, x, y);
		ai[i].comb(ai[i+1], ai[rc]);
		// bug(l, r, ai[i].pref, ai[i].suf, ai[i].ans);
	}
	void updateFree(ll l, ll r)
	{
		updateFree_(0, 0, n-1, l, r);
	}
	void updateFree_(ll i, ll l, ll r, ll x, ll y)
	{
		if(x <= l && r <= y)
		{
			// bug("MARK", l+1, r+1);
			ai[i].prop = 0;
			ai[i].marked = 1;
			ai[i].pref = ai[i].suf = ai[i].ans = r-l+1;
			return;
		}
		
		push(i, l, r);
		ll mid = (l+r)/2, rc = i+2*(mid-l+1);
		if(x <= mid) updateFree_(i+1, l, mid, x, y);
		if(mid < y) updateFree_(rc, mid+1, r, x, y);
		ai[i].comb(ai[i+1], ai[rc]);
		
		// bug(l+1, r+1, ai[i].pref, ai[i].suf, ai[i].ans);
		// bug(l+1, mid+1, "|", mid+1+1, r+1);
		// bug(ai[i+1].pref, ai[i+1].suf, ai[i+1].ans);
		// bug(ai[rc].pref, ai[rc].suf, ai[rc].ans);
		// cerr << nl;
	}
	ll query()
	{
		return ai[0].ans;
	}
};

void solve()
{
	ll n, q;
	cin >> n >> q;
	Hoshino ai;
	ai.build(n);
	
	rep(q)
	{
		ll t;
		cin >> t;
		
		if(t == 1)
		{
			ll a, b;
			cin >> a >> b;
			a--;
			ai.updateOccupy(a, a+b-1);
		}
		else if(t == 2)
		{
			ll a, b;
			cin >> a >> b;
			a--;
			ai.updateFree(a, a+b-1);
		}
		else
		{
			cout << ai.query() << nl;
		}
	}
}
int main()
{
	// ll t;
	// cin >> t;
	// rep(t) solve();
	
	solve();
	
    return 0;
}