#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

using namespace std;


int main() {
	set <int> a;
	int n, x, i, k, y;
	a.insert(0);
	a.insert(1000000);

	cin >> n >> k;

	for (int j = 1; j <= k; j++) {
		cin >> i;
		if (i != 0) {
			a.insert(i);

		}
		else {
			cin >> x >> y;
			auto p1 = a.lower_bound(x);

			int p = distance(a.begin(), p1);
			p1 = a.lower_bound(y);

			int q = distance(a.begin(), p1);
			if (*p1 != y) q--;

			cout << q - p + 1 << endl;
			//cout << q << " " << p  << endl;


		}

	}

	return 0;
}