#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n, m;
struct node {
	int r, h, name;
} b[200005], ques[200005], a[200005];
int ans[200005], ls[200005];
inline bool comp1(node p, node q) {
	return (p.h == q.h) ?  (p.r > q.r) : (p.h < q.h);
}
inline bool comp2(node p, node q) {
	return (p.r == q.r) ? (p.name < q.name) : (p.r > q.r);
}
int t[200005];
inline int lowbit(int p) {
	return p & -p;
}
inline void add(int p, int q) {
	while (p <= n) {
		t[p] = max(t[p], q);
		p += lowbit(p);
	}
}
inline int query(int p) {
	int cnt = 0;
	while (p >= 1) {
		cnt = max(cnt, t[p]);
		p -= lowbit(p);
	}
	return cnt;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> b[i].r >> b[i].h;
	}
	sort(b + 1, b + n + 1, comp1);
	for (int i = 1; i <= m; i++) {
		cin >> ques[i].r >> ques[i].h;
		ques[i].name = i;
	}
	for (int i = 1; i <= n; i++) {
		ls[i] = b[i].h;
		a[i] = b[i], a[i].name = i;
	}
	ls[n + 1] = 1000000001;
	sort(a + 1, a + n + 1, comp2);
	sort(ques + 1, ques + m + 1, comp2);
	int rr = 1;
	a[n + 1].r = -1;
	while (rr <= m && ques[rr].r > a[1].r) {
		ans[ques[rr].name] = query(upper_bound(ls + 1, ls + n + 2, ques[rr].h) - ls - 1);
		rr++;

	}
	int op;
	for (int i = 1; i <= n; i++) {
		op = query(a[i].name);
		add(a[i].name, op + 1);
		while (rr <= m && ques[rr].r > a[i + 1].r) {
			ans[ques[rr].name] = query(upper_bound(ls + 1, ls + n + 2, ques[rr].h) - ls - 1);
			rr++;
		}
	}
	for (int i = 1; i <= m; i++) {
		cout << ans[i] << "\n";
	}
}