// Source: https://usaco.guide/general/io

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

const int K = 31;
const int inf = (int) 1e9;

int main() {
	int N, Q; cin >> N >> Q;

	vector<pair<pair<int, int>, int>> events(N);

	map<int, int> compress;

	for (int i = 0; i < N; i++) {
		cin >> events[i].first.first >> events[i].first.second; events[i].second = i;
		
		compress[events[i].first.first] = 0; compress[events[i].first.second] = 0;
	}

	vector<vector<int>> lift(N, vector<int>(K, -1));

	vector<int> order(N);
    for (int i = 0; i < N; i++) {
        order[i] = i;
    }

    sort(order.begin(), order.end(), [&](int a, int b){
        if (events[a].first.second == events[b].first.second) {
            return events[a].first.first < events[b].first.first;
        }

        return events[a].first.second < events[b].first.second;
    });

    vector<int> on_stack;

    for (int i : order) {
        while (!on_stack.empty() && events[on_stack.back()].first.first >= events[i].first.first) {
            on_stack.pop_back();
        }

        on_stack.push_back(i);

        int l = -1, r = (int) on_stack.size() - 1;
        while (l + 1 < r) {
            int m = l + (r - l) / 2;

            if (events[on_stack[m]].first.second < events[i].first.first) {
                l = m;
            } else {
                r = m;
            }
        }

        lift[i][0] = on_stack[r];
    }

	for (int d = 1; d < K; d++) {
		for (int i = 0; i < N; i++) {
			lift[i][d] = lift[lift[i][d - 1]][d - 1];
		}
	}

	while (Q--) {
		int a, b; cin >> a >> b; a--; b--; swap(a, b);

		if (a == b) {
            cout << 0 << "\n"; continue;
        } else if (events[b].first.second > events[a].first.second) {
            cout << "impossible\n"; continue;
        } else if (events[b].first.second >= events[a].first.second) {
            cout << 1 << "\n"; continue;
        }

        int ans = 0;

        for (int d = K - 1; d >= 0; d--) {
            if (events[lift[a][d]].first.first > events[b].first.second) {
                ans += (1 << d);
                a = lift[a][d];
            }
        }

        if (events[lift[a][0]].first.first <= events[b].first.second) {
            cout << ans + 2 << "\n"; continue;
        } else {
            cout << "impossible\n"; continue;
        }
	}
}