#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<vector>
#define low(x) (x&-x)
#define int long long
using namespace std;
const int N = 1e6;
int mod = 1e9 + 7;
int n, m;
int g[3001][3001];
int a[N];
int t[N][10];
void add(int s, int e) {
	for (int i = s; i <= n; i += low(i)) 
		t[i][e] += 1;
}
int ask(int e, int s) {
	int ans = 0;
	for (int i = s; i; i -= low(i)) 
		ans += t[s][e];
	return ans;
}
void init() {
	for (int i = 1; i <= N; i++) t[i][0] = t[i][1] = 0;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	while (~scanf("%lld%lld", &n, &m)) {
		init();
		for (int i = 1; i <= m; i++) {
			int op, l, r;
			cin >> op >> l >> r;
			if (op == 1) {
				add(l,0), add(r, 1);
			}
			else {
				cout << ask(0,l) - ask(1,r-1) << endl;
			}
		}
	}
	return 0;
}