#include <iostream>
#include <cassert>
#include <vector>
using namespace std;
int n, q;
int al[1000005], ar[1000005];
vector<pair<int, int> > vec[1000005];
struct Segment_Tree {
    int tg[4000005], mn[4000005], mx[4000005];
    void tag(int o, int v) { tg[o] += v, mn[o] += v, mx[o] += v; }
    void pushdown(int o) {
        if (!tg[o]) 
            return;
        tag(o << 1, tg[o]);
        tag(o << 1 | 1, tg[o]);
        tg[o] = 0;
    }
    void Add(int o, int l, int r, int L, int R, int v) {
        if (L <= l && r <= R) {
            tag(o, v);
            return;
        }
        pushdown(o);
        int mid = (l + r) >> 1;
        if (L <= mid) 
            Add(o << 1, l, mid, L, R, v);
        if (R > mid) 
            Add(o << 1 | 1, mid + 1, r, L, R, v);
        mn[o] = min(mn[o << 1], mn[o << 1 | 1]);
        mx[o] = max(mx[o << 1], mx[o << 1 | 1]);
    }
    int Query(int o, int l, int r, int x) {
        if (l == r) 
            return mn[o];
        pushdown(o);
        int mid = (l + r) >> 1;
        if (x <= mid) 
            return Query(o << 1, l, mid, x);
        else 
            return Query(o << 1 | 1, mid + 1, r, x);
    }
    // first position which is less than or equal to v
    int Query1(int o, int l, int r, int x, int v) {
        if (l == r) 
            return mn[o] <= v ? l : 0;
        pushdown(o);
        int mid = (l + r) >> 1;
        if (x <= mid) 
            return Query1(o << 1, l, mid, x, v);
        if (mn[o << 1] <= v) 
            return Query1(o << 1, l, mid, x, v);
        else 
            return Query1(o << 1 | 1, mid + 1, r, x, v);
    }
    // last position which is greater than or equal to v
    int Query2(int o, int l, int r, int x, int v) {
        if (mx[o] < v) 
            return 0;
        if (l == r) 
            return l;
        pushdown(o);
        int mid = (l + r) >> 1;
        if (x <= mid) 
            return Query2(o << 1, l, mid, x, v);
        int tmp = Query2(o << 1 | 1, mid + 1, r, x, v);
        if (tmp == 0) 
            return Query2(o << 1, l, mid, x, v);
        else 
            return tmp;
    }
} seg;
int ans[1000005];
int main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> al[i] >> ar[i];
    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        vec[r].emplace_back(make_pair(l, i));
    }
    for (int i = 1; i <= n; i++) {
        int l, r;
        l = seg.Query1(1, 1, n, i, ar[i]);
        r = seg.Query2(1, 1, n, i, al[i]);
        assert(l);
        if (l > r) 
            continue;
        seg.Add(1, 1, n, l, r, 1);
        for (auto v : vec[i]) ans[v.second] = seg.Query(1, 1, n, v.first);
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
    return 0;
}