#include<bits/stdc++.h>
using namespace std;

#define int long long
// #define int128 __int128_t
#define ls p<<1
#define rs p<<1|1
#define msp(_array) memset(_array,0x3f,sizeof _array)
#define ms0(_array) memset(_array,0,sizeof _array)
#define msn(_array) memset(_array,-1,sizeof _array)
#define mc(_tar,_array) memcpy(_tar,_array,sizeof _tar)
#define pii pair<int,int>
#define endl '\n'

bool bg_memory;
const int mod=(1ll<<60)-1;
const int inf=1e18;
const int bs=23333;
const double eps=1e-6;
const int N=1e6+7,M=1e5+7;
inline void cmax(int &a,int b){a=a<b?b:a;}
inline void cmin(int &a,int b){a=a>b?b:a;}

int n,k;
int l[N],r[N];
int a[N],b;
int ans[N];
vector<int> q[N];
struct sgt{
    int mn[N<<2],mx[N<<2],tg[N<<2];
    void pushup(int p){
        mn[p]=min(mn[ls],mn[rs]);
        mx[p]=max(mx[ls],mx[rs]);
    }
    void pushdown(int p){
        mn[ls]+=tg[p];
        mn[rs]+=tg[p];
        mx[ls]+=tg[p];
        mx[rs]+=tg[p];
        tg[ls]+=tg[p];
        tg[rs]+=tg[p];
        tg[p]=0;
    }
    int getleft(int p,int l,int r,int b){
        if(l==r) return l;
        pushdown(p);
        int mid=l+r>>1;
        if(mn[ls]<=b) return getleft(ls,l,mid,b);
        return getleft(rs,mid+1,r,b);
    }
    int getright(int p,int l,int r,int b){
        if(l==r) return l;
        pushdown(p);
        int mid=l+r>>1;
        if(mx[rs]>=b) return getright(rs,mid+1,r,b);
        return getright(ls,l,mid,b);
    }
    void upd(int p,int l,int r,int ll,int rr){
        if(ll<=l&&rr>=r){
            mn[p]++;
            mx[p]++;
            tg[p]++;
            return;
        }
        pushdown(p);
        int mid=l+r>>1;
        if(ll<=mid) upd(ls,l,mid,ll,rr);
        if(rr>mid) upd(rs,mid+1,r,ll,rr);
        pushup(p);
    }
    int ask(int p,int l,int r,int x){
        if(l==r) return mn[p];
        pushdown(p);
        int mid=l+r>>1;
        if(x<=mid) return ask(ls,l,mid,x);
        return ask(rs,mid+1,r,x);
    }
}sgt;

mt19937 rnd(time(0));
int Case=1;
void Main(){
    
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>l[i]>>r[i];
    for(int i=1;i<=k;i++) cin>>a[i]>>b,q[b].push_back(i);
    for(int i=1;i<=n;i++){
        // cerr<<sgt.getleft(1,1,n,r[i])<<" "<<min(i,sgt.getright(1,1,n,l[i]))<<endl;
        sgt.upd(1,1,n,sgt.getleft(1,1,n,r[i]),min(i,sgt.getright(1,1,n,l[i])));
        for(int j:q[i]) ans[j]=sgt.ask(1,1,n,a[j]);
    }
    for(int i=1;i<=k;i++) cout<<ans[i]<<endl;

    return;
}
string RdFile="c";
bool en_memory;

signed main(){
    auto bg_clock=chrono::high_resolution_clock::now();
#ifdef ONLINE_JUDGE
    // freopen((RdFile+".in").c_str(),"r",stdin);
    // freopen((RdFile+".out").c_str(),"w",stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // cin>>Case;
    while(Case--) Main();
    auto en_clock=chrono::high_resolution_clock::now();
    auto duration_clock=chrono::duration_cast<chrono::microseconds>(en_clock-bg_clock);
#ifndef ONLINE_JUDGE
    cerr<<endl<<"code_time_used: "<<duration_clock.count()*0.001<<"ms"<<endl;
    cerr<<"code_memory_used: "<<(&en_memory-&bg_memory)/1024.0/1024<<"MB"<<endl;
#endif
    return 0;
}