#include <iostream>
#include <vector>
#include <numeric>
#include <unordered_map>
#include <cstdint>
#include <chrono>
#define ll long long
using namespace std;
vector <pair <int, int>> seg;
bool inter(int r, int l) {
if (seg[r].second >= seg[l].first && seg[r].second <= seg[l].second) return true;
return false;
}
bool comp(tuple <int, int, int> a, tuple <int, int, int> b) {
if (get<0>(a) != get<0>(b)) {
return(get<0>(a) > get<0>(b));
}
if (get<1>(a) == 2 && get<1>(b) == 2) {
return(seg[get<2>(a)] > seg[get<2>(b)]);
}
return(get<1>(a) > get<1>(b));
}
vector <pair <int, int>> t;
void update(int v, int vl, int vr, int qi, int q, int segi) {
if (qi < vl || qi >= vr) return;
if (vl == vr - 1) {
t[v] = {q, segi};
return;
}
int vm = (vl + vr) / 2;
update(v * 2, vl, vm, qi, q, segi);
update(v * 2 + 1, vm, vr, qi, q, segi);
if (t[v * 2].first < t[v * 2 + 1].first) {
t[v] = t[v * 2];
} else {
t[v] = t[v * 2 + 1];
}
}
pair <int, int> get(int v, int vl, int vr, int ql, int qr) {
if (qr <= vl || ql >= vr) return {1000000001, -1};
if (vl >= ql && vr <= qr) return t[v];
int vm = (vl + vr) / 2;
pair <int, int> l = get(v * 2, vl, vm, ql, qr);
pair <int, int> r = get(v * 2 + 1, vm, vr, ql, qr);
if (l.first < r.first) return l;
return r;
}
int main() {
int n, q; cin >> n >> q;
seg.resize(n);
vector <tuple<int, int, int>> v(2 * n);
for (int i = 0; i < n; i++) {
cin >> seg[i].first >> seg[i].second;
v[i * 2] = {seg[i].first, 1, i};
v[i * 2 + 1] = {seg[i].second, 2, i};
}
sort(v.begin(), v.end(), comp);
t.resize(n * 4 + 3, {1000000001, -1});
int tt = 0;
int val, is, ind;
vector <vector <int>> aaa(n, vector <int>(18));
vector <int> when(n);
for (int i = 0; i < 2 * n; i++) {
tie(val, is, ind) = v[i];
if (is == 2) {
update(1, 0, n, tt, seg[ind].first, ind);
when[ind] = tt;
tt++;
} else {
aaa[ind][0] = get(1, 0, n, when[ind], tt).second;
if (seg[aaa[ind][0]].first == seg[ind].first) aaa[ind][0] = -1;
}
}
for (int i = 0; i < n; i++) {
for (int j = 1; j < 18; j++) {
if (aaa[i][j - 1] == -1) {
aaa[i][j] = -1;
continue;
}
aaa[i][j] = aaa[aaa[i][j - 1]][j - 1];
if (aaa[i][j] == aaa[i][j - 1]) aaa[i][j] = -1;
}
}
int s, e;
while (q--) {
cin >> s >> e;
s--;
e--;
if (s == e) {
cout << 0 << endl;
continue;
}
int ans = 0;
int cur = e;
for (int i = 17; i >= 0; i--) {
if (aaa[cur][i] != -1 && seg[aaa[cur][i]].first >= seg[s].first) {
ans += (1 << i);
cur = aaa[cur][i];
}
}
if (cur == s) cout << ans << endl;
else if (inter(s, cur)) cout << ans + 1 << endl;
else cout << "impossible" << endl;
}
return 0;
}
