#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
using namespace std;
const int N = 1e6 + 5;

int n, q, ans[N];
pii a[N];
vector<pii> vq[N];

int vl[N << 2], vr[N << 2], lazy[N << 2];
void pushup(int p) {
	vl[p] = vl[lson];
	vr[p] = vr[rson];
}
void pushdown(int p) {
	if (!lazy[p]) return;
	vl[lson] += lazy[p], vl[rson] += lazy[p];
	vr[lson] += lazy[p], vr[rson] += lazy[p];
	lazy[lson] += lazy[p], lazy[rson] += lazy[p];
	lazy[p] = 0;
}
void update(int p, int L, int R, int l, int r) {
	if (l <= L && r >= R) {
		vl[p]++, vr[p]++, lazy[p]++;
		return;
	}
	pushdown(p);
	int mid = L + R >> 1;
	if (l <= mid) update(lson, L, mid, l, r);
	if (r > mid) update(rson, mid + 1, R, l, r);
	pushup(p);
}
int findL(int p, int L, int R, int x) {
	if (vr[p] > x) return -1;
	if (L == R) return L;
	pushdown(p);
	int mid = L + R >> 1;
	if (vr[lson] <= x) return findL(lson, L, mid, x);
	return findL(rson, mid + 1, R, x);
}
int findR(int p, int L, int R, int x) {
	if (vl[p] < x) return -1;
	if (L == R) return L;
	pushdown(p);
	int mid = L + R >> 1;
	if (vl[rson] >= x) return findR(rson, mid + 1, R, x);
	return findR(lson, L, mid, x);
}
int query(int p, int L, int R, int x) {
	if (L == R) return vl[p];
	pushdown(p);
	int mid = L + R >> 1;
	if (x <= mid) return query(lson, L, mid, x);
	return query(rson, mid + 1, R, x);
}

int main() {
	scanf("%d %d", &n, &q);
	for (int i = 1; i <= n; i++) scanf("%d %d", &a[i].fi, &a[i].se);
	for (int i = 1; i <= q; i++) {
		int l, r;
		scanf("%d %d", &l, &r);
		vq[r].push_back(mp(l, i));
	}
	for (int i = 1; i <= n; i++) {
		int lp = findL(1, 1, n, a[i].se), rp = min(findR(1, 1, n, a[i].fi), i);
		if (lp == -1 || rp == -1 || lp > rp) continue;
		update(1, 1, n, lp, rp);
		for (auto j : vq[i]) ans[j.se] = query(1, 1, n, j.fi);
	}
	for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
	return 0;
}