// g++ -std=c++17 -DLOCAL a.cpp -o ex && ./ex >tst.out 2>&1
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << " "; }
void debug_out_nl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
template <typename Head, typename... Tail>
void debug_out_nl(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out_nl(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out(__VA_ARGS__)
#define nl(...) cerr << "#" << #__VA_ARGS__ << ":", debug_out_nl(__VA_ARGS__)
#else
#define dbg(...) 69
#define nl(...) 42
#endif
#define ll long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll random(ll st, ll dr) {
assert(st <= dr);
return st + rng() % (dr - st + 1);
}
const int MOD = 1e9 + 7;
const int N = 2e5 + 10;
struct Node {
int l;
int r;
int val;
Node(int _l = 0, int _r = 0, int _val = 0) : l(_l), r(_r), val(_val) {}
};
template<typename T, typename U>
struct LazySegTree {
int N;
vector<T> data;
vector<U> lazy;
vector<int> lazyFlag;
T inf; // 0, T_MAX, T_MIN etc
// In loc de 0 trebuie constructor pentru T, U
LazySegTree(int _N, T _inf) : N(_N), data(4 * _N + 1, Node()), lazy(4 * _N + 1, Node()), lazyFlag(4 * _N + 1, 0), inf(_inf) {}
// change accordingly (min, max, sum, xor etc)
T merge(const T &x, const T &y, int st, int dr) {
Node ans;
ans.val = max(x.val, y.val);
ans.val = max(ans.val, x.r + y.l);
int mid = (st + dr) / 2;
ans.l = x.l + y.l * (x.l == mid - st + 1);
ans.r = y.r + x.r * (y.r == dr - mid);
return ans;
}
// change accordingly (=, += etc), logic if T != U
void apply(int node, U lazyValue, int flag) {
if (flag) {
lazy[node] = lazyValue; // careful
} else {
data[node] = lazyValue; // careful
}
lazyFlag[node] = flag;
}
// change logic if T != U
void push(int st, int dr, int node) {
if (!lazyFlag[node] || st > dr) {
return;
}
int flag = lazyFlag[node];
apply(node, lazy[node], 0); // atentie la update de tip set cand facem sum pe interval
Node left, right;
int mid = (st + dr) / 2;
if (lazy[node].val > 0) {
left = Node(mid - st + 1, mid - st + 1, mid - st + 1);
right = Node(dr - mid, dr - mid, dr - mid);
}
if (st < dr) {
apply(node << 1, lazy[node], flag);
apply(node << 1 | 1, lazy[node], flag);
}
lazy[node] = Node();
}
void update(int st, int dr, int node, int l, int r, U val) {
push(st, dr, node);
if (st > dr || r < st || l > dr) {
return;
}
if (l <= st && dr <= r) {
int v = (val.val > 0 ? dr - st + 1 : 0);
apply(node, Node(v, v, v), 1);
push(st, dr, node);
return;
}
int mid = (st + dr) >> 1;
update(st, mid, node << 1, l, r, val);
update(mid + 1, dr, node << 1 | 1, l, r, val);
data[node] = merge(data[node << 1], data[node << 1 | 1], st, dr);
}
T query(int st, int dr, int node, int l, int r) {
push(st, dr, node);
if (st > dr || r < st || l > dr) {
return inf;
}
if (l <= st && dr <= r) {
return data[node];
}
int mid = (st + dr) >> 1;
T left = query(st, mid, node << 1, l, r);
T right = query(mid + 1, dr, node << 1 | 1, l, r);
return merge(left, right, st, dr);
}
void update(int l, int r, U val) {
update(1, N, 1, l, r, val);
}
T query(int l, int r) {
return query(1, N, 1, l, r);
}
};
void solve(int test, istream &cin, ostream &cout) {
int n, q;
cin >> n >> q;
LazySegTree<Node, Node> aint(n, Node());
for (int i = 1; i <= n; i++) {
aint.update(i, i, Node(1, 1, 1));
}
nl(aint.query(1, n).val);
for (int op, l, r; q--; ) {
cin >> op;
if (op == 1) {
cin >> l >> r;
aint.update(l, l + r - 1, Node(0, 0, 0));
} else if (op == 2) {
cin >> l >> r;
aint.update(l, l + r - 1, Node(r, r, r));
} else {
cout << aint.query(1, n).val << '\n';
}
}
// cerr << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms" << '\n';
}
int main() {
ifstream cin("hotel.in");
ofstream cout("hotel.out");
ios_base::sync_with_stdio(0);
cin.tie(NULL);
bool multiTest = false;
int t;
if (multiTest) {
cin >> t;
} else {
t = 1;
}
for (int test = 1; test <= t; test++) {
solve(test, cin, cout);
}
return 0;
}