#include<bits/stdc++.h>
using namespace std;

const int NR = 1e5;
const int inf = 1e9;

int n, q, bn;
int c[NR * 2 + 5], b[NR * 2 + 5], L[NR + 5], R[NR + 5], mn[NR * 8 + 5], f[NR + 5][20];

void build(int p, int l, int r) {
    if(l == r) {
        mn[p] = c[l];
        return;
    }
    int mid = l + r >> 1;
    build(p * 2, l, mid);
    build(p * 2 + 1, mid + 1, r);
    if(mn[p * 2] == -1) {
        mn[p] = mn[p * 2 + 1];
    }
    else if(mn[p * 2 + 1] == -1) {
        mn[p] = mn[p * 2];
    }
    else {
        mn[p] = L[mn[p * 2]] < L[mn[p * 2 + 1]] ? mn[p * 2] : mn[p * 2 + 1];
    }
}

int query(int p, int l, int r, int a, int b) {
    if(l >= a && r <= b) {
        return mn[p];
    }
    int mid = l + r >> 1, res1 = -1, res2 = -1;
    if(a <= mid) {
        res1 = query(p * 2, l, mid, a, b);
    }
    if(b > mid) {
        res2 = query(p * 2 + 1, mid + 1, r, a, b);
    }
    if(res1 == -1) {
        return res2;
    }
    if(res2 == -1) {
        return res1;
    }
    return L[res1] < L[res2] ? res1 : res2;
}

int main() {
    // freopen("b.in", "r", stdin);
    // freopen("b.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> q;
    for(int i = 1; i <= n; i++) {
        cin >> L[i] >> R[i];
        b[++bn] = L[i];
        b[++bn] = R[i];
    }
    sort(b + 1, b + bn + 1);
    bn = unique(b + 1, b + bn + 1) - b - 1;
    memset(c, -1, sizeof(c));
    for(int i = 1; i <= n; i++) {
        L[i] = lower_bound(b + 1, b + bn + 1, L[i]) - b;
        R[i] = lower_bound(b + 1, b + bn + 1, R[i]) - b;
        if(c[R[i]] == -1 || L[i] < L[c[R[i]]]) {
            c[R[i]] = i;
        }
    }
    build(1, 1, bn);
    for(int i = 1; i <= n; i++) {
        f[i][0] = query(1, 1, bn, L[i], R[i]);
    }
    for(int j = 1; j <= 19; j++) {
        for(int i = 1; i <= n; i++) {
            f[i][j] = f[f[i][j - 1]][j - 1];
        }
    }
    for(int i = 1; i <= q; i++) {
        int s, t, ans = 0;
        cin >> s >> t;
        if(R[t] < R[s]) {
            cout << "impossible\n";
            continue;
        }
        if(L[t] <= R[s]) {
            cout << "0\n";
            continue;
        }
        for(int j = 19; j >= 0; j--) {
            if(L[f[t][j]] > R[s]) {
                ans += 1 << j;
                t = f[t][j];
            }
        }
        t = f[t][0];
        if(L[t] > R[s]) {
            cout << "impossible\n";
            continue;
        }
        cout << ans + 2 << '\n';
    }

    return 0;
}