#include <bits/stdc++.h>
#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pw(x) (1LL << (x))
using namespace std;
mt19937_64 rng(228);
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key
template <typename T>
bool umn(T& a, T b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
return a < b ? a = b, 1 : 0;
}
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;
const int N = 1e5 + 5;
int n, q;
pii a[N];
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
ios::sync_with_stdio(0);
cin.tie(0);
#endif
cin >> n >> q;
fr (i, 1, n) {
cin >> a[i].fi >> a[i].se;
}
fr (i, 1, q) {
int s, e;
cin >> s >> e;
if (s == e) {
cout << "0\n";
continue;
}
if (a[s].se > a[e].se) {
cout << "impossible\n";
continue;
}
int v = s;
int ans = 0;
bool bad = 0;
while (1) {
if (a[v].se >= a[e].fi) {
ans++;
break;
}
int mx = -1e9;
int mxI = -1;
fr (i, 1, n) {
if (a[i].fi <= a[v].se && a[i].se >= a[v].se) {
if (a[i].se <= a[e].se) {
if (umx(mx, a[i].se)) {
mxI = i;
}
}
}
}
if (mx == a[v].se) {
bad = 1;
break;
}
v = mxI;
ans++;
}
if (!bad) {
cout << ans << "\n";
} else {
cout << "impossible\n";
}
}
return 0;
}
