#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<unordered_map>
#include<vector>
#include<bitset>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<numeric>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lc (x<<1)
#define rc (x<<1|1)
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
#define cout (cerr<<">> ",cout)
const int Mx=1000005,p=998244353;
int read(){
	char ch=getchar();
	int Alice=0,Aya=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-') Aya=-Aya;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		Alice=(Alice<<3)+(Alice<<1)+(ch^48),ch=getchar();
	return (Aya==1?Alice:-Alice);
}
int n,m;
struct Seg{
	int l,r;
}a[Mx],d[Mx];
class SegTree{
	private:
		struct Node{
			int l,r;
			int mn;
			int tag;
		};
		Node t[Mx<<2];
		void PushUp(int x){
			t[x].mn=min(t[lc].mn,t[rc].mn);
		}
		void Apply(int x,int k){
			t[x].tag+=k;
			t[x].mn+=k;
		}
		void PushDown(int x){
			Apply(lc,t[x].tag),Apply(rc,t[x].tag);
			t[x].tag=0;
		}
	public:
		void Build(int x,int l,int r){
			t[x].l=l,t[x].r=r;
			if(l==r){
				t[x].mn=-(l==n+1);
				return;
			}
			int mid=((l+r)>>1);
			Build(lc,l,mid),Build(rc,mid+1,r);
			PushUp(x);
		}
		void Modify(int x,int L,int R){
			int l=t[x].l,r=t[x].r;
			if(L>R) return;
			if(l==L&&r==R){
				Apply(x,1);
				return;
			}
			PushDown(x);
			int mid=((l+r)>>1);
			if(R<=mid) Modify(lc,L,R);
			else if(L>mid) Modify(rc,L,R);
			else Modify(lc,L,mid),Modify(rc,mid+1,R);
			PushUp(x);
		}
		int Qry(int x,int k){
			int l=t[x].l,r=t[x].r;
			if(l==r){
				if(t[x].mn>k) exit(114514);
				return l;
			}
			PushDown(x);
			if(t[lc].mn>k) return Qry(rc,k);
			else return Qry(lc,k);
		}
};
SegTree tr;
signed main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		a[i].l=read(),a[i].r=read();
	}
	tr.Build(1,1,n+1);
	for(int i=1;i<=n;i++){
		int L=tr.Qry(1,a[i].r),R=min(i,tr.Qry(1,a[i].l-1)-1);
		d[i]={L,R};
		tr.Modify(1,L,R);
	}
	for(int Id=1,l,r;Id<=m;Id++){
		l=read(),r=read();
		int res=0;
		for(int i=l;i<=r;i++){
			if(l>=d[i].l&&l<=d[i].r) res++;
		}
		cout<<res<<endl;
	}
	return 0;
}
/*
Hello!!
Sample:
10 10
1 3
2 4
0 2
0 5
0 2
4 9
5 7
3 6
1 9
2 2
-------------------
*/