/*
problem :
created : Programmer_juruo
*/

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

#define N 5000005
#define int long long
#define lowbit(x) x & (-x)
#define Rep(i, n) for(int i = 1; i <= n; i++)
#define rep(i, a, n) for(int i = a; i <= n; i++)
#define Rep2(i, n) for(int i = 0; i < n; i++)
#define dbg(x) cout << #x ":" << x << endl;
#define Se second
#define Fi first
#define Mp make_pair
#define Pb push_back
typedef pair<int, int> Pii;
typedef priority_queue<int> Pq;
typedef long long ll;

int n, m;
int a[N];
inline int Read() {
	int y = 0, f = 1;char c = getchar();
	while(!isdigit(c)){if(c == '-') f = -1;c = getchar();}
	while(isdigit(c)) {y = y*10 + (c - '0'), c = getchar();}
	return y*f;
}
inline void read(int &x){x = Read();}

int id, l, r, k;
int tr[N];
void add(int x, int val) {
	while(x <= n) {
		tr[x] += val;x += lowbit(x);
	}
}

int query(int i) {
	int ans = 0;
	while(i) {
		ans += tr[i];i -= lowbit(i);
	}
	return ans;
}

void work() {
	n = Read(), m = Read();
	Rep(i, m) {
		cin >> id;
		if(id == 0) {
			//plus r
			cin >> l >> r;
			add(l, 1);
			add(r+1, -1);
		}else {
			//query
			cin >> r;
			cout << query(r) << endl;
		}
	}
}

signed main() {
  //freopen("1.in", "r", stdin);
  //freopen("1.out", "w", stdout);
  int T = 1;

  //cin >> T;

  while(T--) {
  	work();
  }

  return 0;
}
*/