#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back 
const ll N = 1000000;
inline ll read(){ ll x; scanf("%lld",&x); return x; }
ll n,q,l[N+5],r[N+5],ans[N+5]; 
vector<P>vec[N+5];
inline ll lowbit(ll x){ return x&(-x); } 
ll c[N+5];
void update(ll x,ll w){
	for(; x <= n; x += x&-x) c[x] += w;
}
ll query(ll x){
	ll ans = 0;
	for(; x; x -= x&-x) ans += c[x]; return ans;
}
int main(){
	n=read(), q=read();
	for(ll i=1;i<=n;i++) l[i]=read(), r[i]=read();
	for(ll i=1;i<=q;i++){
		ll L=read(), R=read();
		vec[R].pb(L, i);
	}
	for(ll i=1;i<=n;i++){
		ll sum = query(i);
		ll ans1 = 0, sum1 = 0;
		for(ll j=19; j>=0; j--){
			if(ans1 + (1<<j) < i){
				if(sum1 + c[ans1 + (1<<j)] < l[i]) {
					sum1 += c[ans1 + (1<<j)];
					ans1 += (1<<j);
				}
			}
		}
		ll ans2 = 0, sum2 = 0;
		for(ll j=19; j>=0; j--){
			if(ans2 + (1<<j) < i){
				if(sum2 + c[ans2 + (1<<j)] <= r[i]) {
					sum2 += c[ans2 + (1<<j)];
					ans2 += (1<<j);
				}
			}
		}
		
		update(ans1+1, 1); update(ans2+1, -1);
		if(l[i] == 0) update(i, 1), update(i+1, -1); 
		for(auto p: vec[i]){
			ans[p.se] = query(p.fi);
		}
	}
	for(ll i=1;i<=q;i++) printf("%lld\n", ans[i]);
}