#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) x&(-x)
const int M = 500000;
int ans[500005],dp[500005],tree[500005];

struct node{
	int a,b,v,id;
}a[500005];;int n,q;
bool cmp(node a,node b){
	if(a.b == b.b){
		if(a.a == b.a)return a.v>b.v;
		return a.a<b.a;
	}return a.b<b.b;
}void update(int pos,int add){
	for(int i = pos;i<=M;i+=lowbit(i))tree[i] = max(tree[i],add);
}int query(int pos){
	int mx =0;for(int i =pos;i>0;i-=lowbit(i))mx = max(mx,tree[i]);return mx;
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> q;vector<int>pp;
	for(int i = 1;i<=n;i++){
		cin >> a[i].a >> a[i].b;a[i].v = 1;a[i].v = 1;a[i].id = i;
		pp.push_back(a[i].a);
	}for(int i = n+1;i<=n+q;i++){
		cin >> a[i].a >> a[i].b;a[i].v = 0;a[i].v = 0;a[i].b++;a[i].id = i;
		pp.push_back(a[i].a);
	}//for(int i = 1;i<=n;i++)cout << a[i].a << " " << a[i].b << " " << a[i].v << " " << a[i].id << endl;
	//cout << endl;
	sort(pp.begin(),pp.end());pp.erase(unique(pp.begin(),pp.end()),pp.end());
	for(int i = 1;i<=n+q;i++){
		a[i].a = pp.size()-(lower_bound(pp.begin(),pp.end(),a[i].a)-pp.begin());
	}sort(a+1,a+1+n+q,cmp);
	
	for(int i = 1;i<=n+q;){
		int j = i;
		while(j<=n+q and a[j].b == a[i].b)j++;
		for(int k = i;k<j;k++){
			dp[k] = a[k].v+query(a[k].a);ans[a[k].id] = dp[k];
		}for(int k = i;k<j;k++)update(a[k].a,dp[k]);
	//	cout << " " << i << " " << j << endl;
		i = j;
	}//for(int i = 1;i<=n+q;i++)cout << a[i].a << " " << a[i].b << " " << a[i].v << " " << a[i].id  << " " << dp[i]<< endl;
	for(int i = n+1;i<=n+q;i++)cout << ans[i] << '\n';
	
	return 0;
}/*
最小链覆盖 = 最长反链。
把询问也当作点放进去跑LIS。 
7 3
9 5
3 7
10 6
5 10
2 6
10 10
4 1
10 5
3 5
3 9

*/