#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
const int M = 1e5 + 5;
#define ll long long
#define inf 2147483647
#define PII pair<int, int> 

map<PII, int> h;
int lx[N], rx[N];
void solve()
{
	int n, q;
	while (cin >> n >> q)
	{
		for (int i = 1; i <= n; i++) lx[i] = rx[i] = 0;
		h.clear();
		int cnt = 0;
		while (q--)
		{
			int op, l, r;
			cin >> op >> l >> r;
			
			if (op == 1)
			{
				h[{l, r}]++;
				lx[l]++;
				rx[r]++;
				cnt++;
			}
			else
			{
				int sum = 0;
				for (int i = l; i <= r; i++) sum += lx[i], sum += rx[i];
				for (int i = l; i <= r; i++)
				{
					for (int j = l; j <= r; j++)
					{
						if (i <= l && r <= j && i <= j)
						{
							sum -= h[{l, r}] * 2;
							continue; 
						}
					}
				}

				cout << cnt - sum << '\n';
			}
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
	//cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}