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

#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
const int N=1e6+100,INF=1e9;
#define gc getchar()
#define rd read()
inline int read(){
	int x=0,f=0; char c=gc;
	for(;c<'0'||c>'9';c=gc) f|=(c=='-');
	for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

int n,m,ans[N],x[N],y[N];
vector<pii> q[N];

#define lc (id<<1)
#define rc (id<<1|1)
#define mid (l+r>>1)
struct TREE{ int mn,mx,atag; }t[N<<2];
void pushup(int id){ t[id].mn=min(t[lc].mn,t[rc].mn),t[id].mx=max(t[lc].mx,t[rc].mx); }
void add0(int id,int v){ t[id].mn+=v,t[id].mx+=v,t[id].atag+=v; }
void spread(int id){ int &v=t[id].atag; if(v!=0) add0(lc,v),add0(rc,v),v=0; }
void bui(int id,int l,int r){
	t[id]={INF,-INF,0}; if(l==r) return;
	bui(lc,l,mid),bui(rc,mid+1,r);
}
void chg(int id,int l,int r,int ql,int v){
	if(l==r) return t[id].mn=t[id].mx=v,void(); spread(id);
	ql<=mid?chg(lc,l,mid,ql,v):chg(rc,mid+1,r,ql,v); pushup(id);
}
void add(int id,int l,int r,int ql,int qr,int v){
	if(ql<=l&&r<=qr) return add0(id,v); spread(id);
	if(ql<=mid) add(lc,l,mid,ql,qr,v);
	if(qr>=mid+1) add(rc,mid+1,r,ql,qr,v);
	pushup(id);
}
int ask(int id,int l,int r,int ql){
	if(l==r) return t[id].mn; spread(id);
	return ql<=mid?ask(lc,l,mid,ql):ask(rc,mid+1,r,ql);
}
int ask0(int id,int l,int r,int v){
	if(l==r) return t[id].mn<=v?l:-1; spread(id);
	return t[rc].mx>=v?ask0(rc,mid+1,r,v):ask0(lc,l,mid,v);
}
int ask1(int id,int l,int r,int v){
	if(l==r) return t[id].mn>=v?l:-1; spread(id);
	return t[lc].mn<=v?ask1(lc,l,mid,v):ask1(rc,mid+1,r,v);	
}
#undef lc
#undef rc
#undef mid

int main(){
	
	n=rd,m=rd;
	for(int i=1;i<=n;++i) x[i]=rd,y[i]=rd;
	for(int i=1,l,r;i<=m;++i) l=rd,r=rd,q[r].pb({l,i});
	
	bui(1,1,n);
	for(int i=1,l,r;i<=n;++i){
		chg(1,1,n,i,0);
		l=ask1(1,1,n,y[i]),r=ask0(1,1,n,x[i]);
		if(l!=-1&&r!=-1) add(1,1,n,ask1(1,1,n,y[i]),ask0(1,1,n,x[i]),1);
		for(auto [l,id]:q[i]) ans[id]=ask(1,1,n,l);
	}
	for(int i=1;i<=m;++i) printf("%d\n", ans[i]);
	
	return 0;
}