#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10;

int n, q, pos[MAXN];

struct Data
{
    int l, r, id;
    bool operator < (const Data u) const {return (r == u.r ? l < u.l : r < u.r);}
}a[MAXN];
int b[MAXN];

int f[MAXN][22];

int tr[MAXN << 2];
void Update(int cur, int l, int r, int x)
{
    if (l == r) tr[cur] = (a[tr[cur]].l > a[x].l ? x : tr[cur]);
    else
    {
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x);
        else Update(cur << 1 | 1, mid + 1, r, x);
        tr[cur] = (a[tr[cur << 1]].l < a[tr[cur << 1 | 1]].l ? tr[cur << 1] : tr[cur << 1 | 1]);
    }
}
int Query(int cur, int l, int r, int x, int y)
{
    if (x <= l && r <= y) return tr[cur];
    int mid = l + r >> 1;
    if (y <= mid) return Query(cur << 1, l, mid, x, y);
    if (x > mid) return Query(cur << 1 | 1, mid + 1, r, x, y);
    int res1 = Query(cur << 1, l, mid, x, y), res2 = Query(cur << 1 | 1, mid + 1, r, x, y);
    return (a[res1].l < a[res2].l ? res1 : res2);
}

int main()
{
    // freopen("B.in", "r", stdin);
    // freopen("B.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(q);
    for (int i = 1; i <= n; i++) Read(a[i].l), Read(a[i].r), a[i].id = i;
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) pos[a[i].id] = i, b[i] = a[i].r;
    a[0].l = 2e9;
    for (int i = 1; i <= n; i++)
    {
        if (i == 1) {Update(1, 1, n, i); continue;}
        int l = lower_bound(b + 1, b + n + 1, a[i].l) - b, r = i - 1;
        if (l <= r) f[i][0] = Query(1, 1, n, l, r);
        Update(1, 1, n, i);
    }
    // for (int i = 1; i <= n; i++) cout << a[i].l << " " << a[i].r << " " << f[i][0] << "\n";
    for (int j = 1; j <= 20; j++)
        for (int i = n; i >= 1; i--)
            f[i][j] = f[f[i][j - 1]][j - 1];
    int u, v;
    while (q--)
    {
        Read(u), Read(v), u = pos[u], v = pos[v];
        if (u == v) {cout << "0\n"; continue;}
        if (a[u].r > a[v].r) {cout << "impossible\n"; continue;}
        if (a[u].r >= a[v].l && a[u].r <= a[v].r) {cout << "1\n"; continue;}
        int ans = 0;
        for (int i = 20; i >= 0; i--)
            if (f[v][i] && a[f[v][i]].l > a[u].r) v = f[v][i], ans += (1 << i);//, cout << v << " " << f[v][i] << "\n";
        if (f[v][0] && a[f[v][0]].l <= a[u].r) cout << ans + 2 << "\n";
        else cout << "impossible\n";
    }
    return 0;
}