#include <bits/stdc++.h>
#define endl '\n'
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define F first
#define S second
#define pf push_front
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ld long double
#define int long long
#define str string
#define vi vector <int>
#define pii pair <int,int>
#define tiii tuple<int,int,int>
#define vpi vector<pair<int,int>>
#define vb vector<bool>
#define vs vector<string>
#define vc vector<char>
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define out(v) for (auto x:v) cout << x << ' '
#define out1(v) for (auto x:v) cout << x << endl
#define inp(arr) for (int i=0;i<arr.size();i++) cin>>arr[i]
const int MAX=1e6+10;
const int MOD=1e9+7;
using namespace std;
const int inf=1e8;
int vis[MAX];
vpi vt[MAX];
int arr[MAX];
int cc=0;
bool cmp(pii a,pii b){
if(a.F==b.F){
return a.S>b.S;
}
return a.F<b.F;
}
void solve(){
int n,q;
cin>>n>>q;
vpi arr(n);
for(int i=0;i<n;i++){
cin>>arr[i].F>>arr[i].S;
}
while(q--){
int a,b;
cin>>a>>b;
vpi vt;
for(int i=0;i<n;i++){
if(arr[i].F>=a && arr[i].S<=b) vt.pb({arr[i].F,arr[i].S});
}
if(!vt.size()){
cout<<0<<endl;
continue;
}
sort(all(vt),cmp);
multiset<int> st;
for(auto[l,r]:vt){
if(st.size()==0){
st.insert(r);
}
else{
auto it=st.lower_bound(r);
auto it1=st.begin();
if(it==it1) st.insert(r);
else{
it--;
st.erase(it);
st.insert(r);
}
}
}
cout<<st.size()<<endl;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int t=1;
//cin>>t;
while(t--) {
solve();
}
}
