#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r
using namespace std;
const int INF = 0x7FFFFFFF;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int MOD = 1e9 + 7;
const int maxn = 60000 + 66;
int Left[maxn<<2], Right[maxn<<2];
void PushUp (int rt, int id)
{
if (id == 1)
Left[rt] = Left[rt<<1] + Left[rt<<1|1];
else
Right[rt] = Right[rt<<1] + Right[rt<<1|1];
}
void UpDate (int rt, int l, int r, int vv, int id)
{
if (l == r)
{
if (id == 1)
Left[rt]++;
else
Right[rt]++;
return ;
}
int m = (l + r) >> 1;
if (vv <= m)
UpDate (lson, vv, id);
else
UpDate (rson, vv, id);
PushUp (rt, id);
}
int Query (int rt, int l, int r, int L, int R, int id)
{
if (L <= l && r <= R)
{
if (id == 1)
return Left[rt];
else
return Right[rt];
}
int m = (l + r) >> 1, res = 0;
if (L <= m)
res += Query (lson, L, R, id);
if (R >= m + 1)
res += Query (rson, L, R, id);
return res;
}
int main()
{
// ifstream cin ("aaa.txt");
int n, m;
cin >> n >> m;
int op, a, b;
memset (Left, 0, sizeof (Left));
memset (Right, 0, sizeof (Right));
for (int i = 1; i <= m; i++)
{
cin >> op >> a >> b;
if (op == 1)
{
UpDate (1, 1, n, a, 1);
UpDate (1, 1, n ,b, 2);
}
else
{
if (a == 1)
cout << Query (1, 1, n, 1, b, 1) << endl;
else
cout << Query (1, 1, n, 1, b, 1) - Query (1, 1, n, 1, a - 1, 2) << endl;
}
}
return 0;
}