#include <fstream>
#include <algorithm>

using namespace std;

struct AINT
{
	int left, right, best;
	int flag; // 2 daca propag cand sunt ocupate, 1 cand sunt libere
};

const int NMAX = 1e5 + 10;
int n, q, op;
AINT aint[4 * NMAX];

inline int LeftSon(const int &x)
{
	return 2 * x;
}

inline int RightSon(const int &x)
{
	return 2 * x + 1;
}

inline int Query()
{
	return aint[1].best;
}

inline void Calculate(const int &node, const int &left, const int &right)
{
	int mid = (left + right) / 2;
	aint[node].best = max(max(aint[LeftSon(node)].best, aint[RightSon(node)].best), aint[LeftSon(node)].left + aint[RightSon(node)].right);
	aint[node].left = (aint[RightSon(node)].left == (right - mid)) ? (right - mid) + aint[LeftSon(node)].left : aint[RightSon(node)].left;
	aint[node].right = (aint[LeftSon(node)].right == (mid - left + 1)) ? (mid - left + 1) + aint[RightSon(node)].right : aint[LeftSon(node)].right;
}

void Build(int node, int left, int right)
{
	if (left == right)
	{
		aint[node].left = aint[node].right = aint[node].best = 1;
		aint[node].flag = false;
		return;
	}
	int mid = (left + right) / 2;
	Build(LeftSon(node), left, mid);
	Build(RightSon(node), mid + 1, right);
	Calculate(node, left, right);
}

void Propagate(const int &node, const int &left, const int &right)
{
	if (!aint[node].flag || left == right)
		return;
	int mid = (left + right) / 2;
	aint[LeftSon(node)].left = aint[LeftSon(node)].right = aint[LeftSon(node)].best = (aint[node].flag == 2) * (mid - left + 1);
	aint[RightSon(node)].left = aint[RightSon(node)].right = aint[RightSon(node)].best = (aint[node].flag == 2) * (right - mid);
	aint[LeftSon(node)].flag = aint[RightSon(node)].flag = true;
	aint[node].flag = false;
}

void Update(int node, int left, int right, const int &LeftQuery, const int &RightQuery)
{
	Propagate(node, left, right);
	if (LeftQuery <= left && right <= RightQuery)
	{
		aint[node].left = aint[node].right = aint[node].best = (op == 2) * (right - left + 1);
		aint[node].flag = (op % 2);
		return;
	}
	int mid = (left + right) / 2;
	if (LeftQuery <= mid)
		Update(LeftSon(node), left, mid, LeftQuery, RightQuery);
	if (RightQuery >= mid + 1)
		Update(RightSon(node), mid + 1, right, LeftQuery, RightQuery);
	Calculate(node, left, right);
}

int main()
{
	ifstream fin("hotel.in");
	ofstream fout("hotel.out");
	fin >> n >> q;
	Build(1, 1, n);
	int x, y;
	for (int i = 1;i <= q;++i)
	{
		fin >> op;
		if (op == 3)
			fout << Query() << "\n";
		else
		{
			fin >> x >> y;
			Update(1, 1, n, x, x + y - 1);
		}
	}
	fin.close();
	fout.close();
	return 0;
}