#include<iostream>
#include<cstdio>
using namespace std;
#define maxn 1000010
#define low(x) (x&-x)
typedef long long ll;
int n, q, t[maxn][2];

void add(int x, int flg) {
	while (x <= n) {
		t[x][flg] += 1;
		x += low(x);
	}
}
int sum(int x, int flg) {
	int res = 0;
	while (x > 0) {
		res += t[x][flg];
		x -= low(x);
	}
	return res;
}
int main() {
	while (~scanf("%d%d", &n, &q)) {
		for (int i = 1; i <= n; i++) t[i][0] = t[i][1] = 0;
		for (int i = 1; i <= q; i++) {
			int op, l, r; scanf("%d%d%d", &op, &l, &r);
			if (op == 1) {
				add(l, 0); add(r, 1);
			}
			else {
				printf("%d\n", sum(l, 0) - sum(r - 1, 1));
			}
		}
	}
	return 0;
}