#include <bits/stdc++.h>
#define pii pair<int, int>
#define mkp make_pair
using namespace std;
const int N = 1000100;
int n, q;
int a[N], b[N];
struct BIT{
    int c[N];
    void add(int x, int k) {
        for (; x <= n; x += -x & x)
            c[x] += k;
        return;
    }
    void add(int l, int r, int k) {
        add(l, k), add(r + 1, -k);
        return;
    }
    int ask1(int k) {
        int x = 0, s = 0;
        for (int i = 19; i >= 0; --i) {
            if (s + c[x + (1 << i)] > k) {
                x += 1 << i, s += c[x];
            }
        }
        return x + 1;
    }
    int ask2(int k) {
        int x = 0, s = 0;
        for (int i = 19; i >= 0; --i) {
            if (x + (1 << i) <= n && s + c[x + (1 << i)] >= k) {
                x += 1 << i, s += c[x];
            }
        }
        return x;
    }
    int ask(int x) {
        int k = 0;
        for (; x; x -= -x & x)
            k += c[x];
        return k;
    }
} zq;
vector<pii> query[N];
int ans[N];
int main() {
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) scanf("%d%d", a + i, b + i);
    for (int i = 1, x, y; i <= q; ++i) {
        scanf("%d%d", &x, &y);
        query[y].push_back(mkp(x, i));
    }
    for (int i = 1; i <= n; ++i) {
        int u = zq.ask1(b[i]), v = min(zq.ask2(a[i]), i);
        if (u <= v) zq.add(u, v, 1);
        for (pii x : query[i])
            ans[x.second] = zq.ask(x.first);
    }
    for (int i = 1; i <= q; ++i) printf("%d ", ans[i]);
    return 0;
}