#include "bits/stdc++.h"
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long

#define OPEN freopen (".in", "r", stdin); freopen (".out", "w", stdout);
#define DATA freopen (".in", "w", stdout);

#define pc __builtin_popcount
#define db double
#define pii pair<int, int>
#define fi first
#define se second

#define F(i,x,y) for (int i = (x); i <= (y); ++i)
#define D(i,x,y) for (int i = (x); i >= (y); --i)

using namespace std;

const ll inf = 1ll * 1e18;
const ll mod = 998244353ll;
//const ll mod = 1ll * 1e9 + 7ll;

namespace FastIO {
	inline void Rd(int& x) {
		int f = 1;
		x = 0;
		char c = getchar();
		while (c < '0' || c > '9') {
			if (c == '-') f = -1;
			c = getchar();
		}
		while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c - 48), c = getchar();
		x *= f;
	}

	inline void Wt(int x) {
		if (x < 10) {
			putchar(x + 48);
			return;
		}
		Wt(x / 10);
		putchar((x % 10) + 48);
	}
}

namespace Maths {
	ll fac[560000];

	void init() {

		fac[0] = 1ll;

		F(i, 1, 500000) fac[i] = fac[i - 1] * i % mod;
	}

	ll qpow(ll x, ll y) {
		if (y == 0ll) return 1ll;

		ll w = qpow(x, y / 2ll);

		if (y % 2ll) return (w * w % mod) * x % mod;
		else return w * w % mod;
	}

	inline ll C(ll x, ll y) {
		return (fac[x] * qpow(fac[y], mod - 2ll) % mod) * qpow(fac[x - y], mod - 2ll) % mod;
	}

	inline ll div(ll x) {
		return qpow(x, mod - 2ll);
	}
}
int n, q;
namespace Sgt {
	int b[4000010], mn[4000010], mx[4000010];
	
	void Build (int l, int r, int p) {
		if (l == r) {
			if (l == 0) mn[p] = mx[p] = 0x3f3f3f3f;
			if (l == n + 1) mn[p] = mx[p] = -0x3f3f3f3f;
			return ;
		}
		int m = (l + r) >> 1;
		Build (l, m, p << 1); Build (m + 1, r, p << 1 | 1);
		mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
		mn[p] = min(mn[p << 1], mn[p << 1 | 1]);
	}
	
	void Pushdown (int l, int r, int p) {
		int m = (l + r) >> 1;
		
		mn[p << 1] += b[p]; mn[p << 1 | 1] += b[p];
		mx[p << 1] += b[p]; mx[p << 1 | 1] += b[p];
		
		b[p << 1] += b[p]; b[p << 1 | 1] += b[p];
		
		b[p] = 0;
	}
	
	void Add (int l, int r, int s, int t, int p) {
		if (l <= s && t <= r) {
			mx[p] ++; mn[p] ++;
			++ b[p];
			return ;
		}
		
		Pushdown (s, t, p);
		
		int m = (s + t) >> 1;
		
		if (l <= m) Add (l, r, s, m, p <<1);
		if (m < r) Add (l, r, m + 1, t, p << 1 | 1);
		
		mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
		mn[p] = min(mn[p << 1], mn[p << 1 | 1]);
	}
	
	int Lower (int l, int r, int p, int v) {
		if (l == r) return l;
		int m = (l + r) >> 1;
		Pushdown (l, r, p);
		if (mn[p << 1] < v) return Lower(l, m, p << 1, v);
		else return Lower (m + 1, r ,p << 1 | 1 , v);
	}
	
	int Upper (int l, int r, int p, int v) {
		if (l == r) return l;
		int m = (l + r) >> 1;
		Pushdown (l, r, p);
		if (mx[p << 1 | 1] > v) return Upper (m + 1 ,r , p << 1 | 1, v);
		else return Upper (l, m, p << 1, v);
	}
	
	int Query (int l, int r, int x, int p) {
		if (l == r) return mx[p];
		int m = (l + r) >> 1;
		Pushdown (l, r, p);
		if (x <= m) return Query (l, m, x, p << 1);
		else return Query (m + 1, r, x, p << 1 | 1);
	}
}
int L[1200000], R[1200000];

struct Opt {
	int l, r, id;
	bool operator <(const Opt& p) const {
		return r < p.r;
	}
}op[1200000];

int ans[1200000];

int main() {
	cin >> n >> q;
	Sgt::Build(0, n + 1, 1);
	F(i, 1, n) {
		cin >> L[i] >> R[i];
	}
	
	F(i, 1, q) {
		cin >> op[i].l >> op[i].r; op[i].id = i;
	}
	
	sort (op + 1, op + n + 1);
	
	for (int i = 1, j = 1; i <= n; ++ i) {
		int _l = Sgt::Upper(0, n + 1, 1, R[i]) + 1;
		int _r = Sgt::Lower(0, n + 1, 1, L[i]) - 1;
		
		cerr << _l << ' ' << _r << '\n';
		
		Sgt::Add(_l, _r, 0, n + 1, 1);
		
		for ( ;op[j].r == i; ++ j) {
			int Sum = Sgt::Query (0, n + 1, op[j].l, 1);
			ans[op[j].id] = Sum;
		}
	}
	
	F(i, 1, n) cout << ans[i] << '\n';
}