#if defined(_USE_PCH_)
#include "pch.hpp"
#else
#include <bits/stdc++.h>
#endif
#define RNG(V_, A_, B_, ...) for(int V_=(A_), V_##_END=(B_) __VA_OPT__(,) __VA_ARGS__; V_<=V_##_END; V_++)
#define IRNG(V_, A_, B_) for(int V_=(A_), V_##_END=(B_); V_>=V_##_END; V_--)
#ifdef _WIN32
#define long __int64
#endif
using namespace std;
const int MAXN=1e6+10,INF=1e9;
int n,qn,ans[MAXN];
struct{ int l,r; } A[MAXN];
struct Qt{ int l,r,id; }; Qt Q[MAXN];
struct SGT{
#define ls (u*2)
#define rs (u*2+1)
#define mid ((l+r)/2)
    int mx[MAXN],mn[MAXN],tag[MAXN];
    void build(int u,int l,int r){
        mx[u]=mn[u]=-INF;
        if(l==r) return;
        build(ls,l,mid),build(rs,mid+1,r);
    }
    void pushup(int u){ mx[u]=max(mx[ls],mx[rs]),mn[u]=min(mn[ls],mn[rs]); }
    void upd(int u,int x){ mx[u]+=x,mn[u]+=x,tag[u]+=x; }
    void pushdown(int u){ upd(ls,tag[u]),upd(rs,tag[u]); tag[u]=0; }
    void set(int u,int l,int r,int i,int x){
        if(l==r){ mx[u]=mn[u]=x; return; }
        pushdown(u);
        if(i<=mid) set(ls,l,mid,i,x);
        else set(rs,mid+1,r,i,x);
        pushup(u);
    }
    int qry(int u,int l,int r,int i){
        if(l==r) return mx[u];
        pushdown(u);
        if(i<=mid) return qry(ls,l,mid,i);
        else return qry(rs,mid+1,r,i);
    }
    void solve(int u,int l,int r,int vl,int vr){
        if(vr<mn[u]||mx[u]<vl) return;
        if(vl<=mn[u]&&mx[u]<=vr){ upd(u,1); return; }
        pushdown(u);
        solve(ls,l,mid,vl,vr),solve(rs,mid+1,r,vl,vr);
        pushup(u);
    }
#undef ls
#undef rs
#undef mid
} sgt;
int main(){
#if defined(_LOCAL_)
    freopen("in","r",stdin);
//  freopen("out","w",stdout);
#else
//  freopen("c.in","r",stdin);
//  freopen("c.out","w",stdout);
#endif
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>qn;
    RNG(i,1,n) cin>>A[i].l>>A[i].r;
    RNG(i,1,qn){
        int l,r; cin>>l>>r;
        Q[i]={l,r,i};
    }
    sort(Q+1,Q+qn+1,[](auto x,auto y){ return x.r<y.r; });
    sgt.build(1,1,n);
    RNG(i,1,n,j=0){
        sgt.set(1,1,n,i,0);
        sgt.solve(1,1,n,A[i].l,A[i].r);
        while(j<qn&&Q[j+1].r==i) j++,ans[Q[j].id]=sgt.qry(1,1,n,Q[j].l);
    }
    RNG(i,1,qn) cout<<ans[i]<<"\n";
}