/*
* @Author: RMQuan
* @Date: 2025-10-23 14:32:51
* @Last Modified by: RMQuan
* @Last Modified time: 2025-10-23 15:39:24
*/
/*idea :
*/
#include <bits/stdc++.h>
bool M1;
#define int long long
#define ll long long
#define INTMAX INT_MAX
#define INTMIN INT_MIN
#define LONGMAX LLONG_MAX
#define LONGMIN LLONG_MIN
#define fi first
#define se second
#define memfull(a,b) memset(a,b,sizeof(a));
#define endl '\n'
#define TASK "TEST"
#define file() if (fopen(TASK".inp","r")){freopen(TASK".inp","r",stdin); freopen(TASK".out","w",stdout);}
using namespace std;
const int MOD=1e9+7;
const int maxn=2e5+7;
int n,q,ans[maxn];
vector<int> nenR,nenH;
int R[maxn],H[maxn],A[maxn],B[maxn];
struct BIT
{
int N;
vector<int> bit;
BIT(int n):N(n),bit(n+5,0){}
void upd(int x,int val)
{
for (;x<=N;x+=(x&-x))bit[x]+=val;
}
int get(int x)
{
int sum=0;
for (;x>0;x&=(x-1))sum+=bit[x];
return sum;
}
};
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
file();
cin>>n>>q;
nenH.push_back(-1e18);
nenR.push_back(-1e18);
for (int i=1;i<=n;i++)
{
cin>>R[i]>>H[i];
nenR.push_back(R[i]);
nenH.push_back(H[i]);
}
for (int i=1;i<=q;i++)
{
cin>>A[i]>>B[i];
nenR.push_back(A[i]);
nenH.push_back(B[i]);
}
sort(nenR.begin(),nenR.end());
sort(nenH.begin(),nenH.end());
nenR.erase(unique(nenR.begin(),nenR.end()),nenR.end());
nenH.erase(unique(nenH.begin(),nenH.end()),nenH.end());
int N_R=nenR.size()+5;
int N_H=nenH.size()+5;
vector<vector<pair<int,int> > > qr_upd(N_R+5,vector<pair<int,int> >(0)),qr_get(N_R+5,vector<pair<int,int> >(0));
for (int i=1;i<=n;i++)
{
R[i]=lower_bound(nenR.begin(),nenR.end(),R[i])-nenR.begin();
H[i]=lower_bound(nenH.begin(),nenH.end(),H[i])-nenH.begin();
qr_upd[R[i]].push_back({-1,H[i]});
}
for (int i=1;i<=q;i++)
{
A[i]=lower_bound(nenR.begin(),nenR.end(),A[i])-nenR.begin();
B[i]=lower_bound(nenH.begin(),nenH.end(),B[i])-nenH.begin();
qr_get[A[i]].push_back({B[i],i});
}
BIT bit(N_H);
multiset<int> mt;
for (int i=N_R;i>=0;i--)
{
vector<int> add;
for (auto j:qr_upd[i])
{
auto it=mt.upper_bound(j.se);
if (it==mt.end())add.push_back(j.se);
else
{
bit.upd(*it,-1);
mt.erase(it);
add.push_back(j.se);
}
}
for (auto j:add)
{
mt.insert(j);
bit.upd(j,1);
}
for (auto j:qr_get[i])ans[j.se]=bit.get(j.fi);
}
for (int i=1;i<=q;i++)cout<<ans[i]<<endl;
bool M2;
cerr<<"-------------------------------------------------"<<endl;
cerr<<"Time : "<<clock()<<" ms"<<endl;
cerr<<"Memory : "<<abs(&M2-&M1)/1024/1024<<" MB"<<endl;
cerr<<"-------------------------------------------------"<<endl;
return 0;
}
