#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
if(e==0) return 1;
int tmp=expo(b,e/2);
if(e%2) return mul(tmp,mul(tmp,b));
else return mul(tmp,tmp);
}
const int maxn=4e5;
bool cmp(pii x,pii y){
if(x.fi==y.fi) return x.se<y.se;
return x.fi>y.fi;
}
bool cmp1(array<int,3>a,array<int,3>b){
if(a[0]==b[0]) return a[1]<b[1];
return a[0]>b[0];
}
int BIT[maxn+2];
int qry(int id){
int sum = 0; for(;id>=1;id-=id&-id) sum=max(sum,BIT[id]); return sum;
}
void upd(int id, int v) {
for(;id<=4e5;id+=id&-id) BIT[id]=max(BIT[id],v);
}
int query(int l, int r){
return qry(r)- qry(l-1);
}
void upd_range(int l, int r, int v) {
upd(l,v);
upd(r+1,-v);
}
void solve(){
int n,q;cin>>n>>q;
pii item[n+2];
array<int,3>que[q+2];
repp(i,1,n) cin>>item[i].fi>>item[i].se;
sort(item+1,item+n+1,cmp);
repp(i,1,q){
cin>>que[i][0]>>que[i][1];
que[i][2]=i;
}
sort(que+1,que+q+1,cmp1);
vector<int>comp;
repp(i,1,n) comp.pb(item[i].se);
repp(i,1,q) comp.pb(que[i][1]);
sort(all(comp));
comp.erase(unique(all(comp)),comp.end());
int j=1;
int ans[q+2];
repp(i,1,q){
while(j<=n && item[j].fi>=que[i][0]){
int nw=lower_bound(all(comp),item[j].se)-comp.begin()+1;
upd(nw,qry(nw)+1);
j++;
}
ans[que[i][2]]=qry(lower_bound(all(comp),que[i][1])-comp.begin()+1);
}
repp(i,1,q) cout<<ans[i]<<endl;
}
signed main(){
liow;
int t=1;
//cin>>t;
while(t--){
solve();
}
}
