#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,n) for (int i=0; i<n; ++i)
#define pb(x) push_back(x);
#define f first
#define s second
void solve() {
int n, m; cin>>n>>m;
vector<pair<int,int>> a(n);
forn(i,n) cin>>a[i].first>>a[i].second;
vector<vector<int>> adj(n);
if (n<=5000) {
forn(i,n) {
forn(j,n) {
if (i==j) continue;
if (a[j].f<=a[i].s && a[i].s<=a[j].s) adj[i].pb(j);
}
}
} else {
set<pair<int,int>> s;
forn(i,n) s.insert({a[i].s,i});
auto p = s.end(); --p;
for (;;--p) {
auto x=*p; int i=x.s;
auto it = s.upper_bound({a[i].f,-1});
auto z=*it; if (z.f<a[x.s].f) ++it;
while (it!=s.end() && (*it).f<=x.f) {
if ((*it).s!=i) adj[(*it).s].pb(i);
++it;
}
if (p==s.begin()) break;
}
}
vector<int> vis(n,0);
vector<int> dist(n,-1);
forn(i,m) {
int u,v; cin>>u>>v;
--u, --v;
queue<int> q;
q.push(u);
vis[u]=1, dist[u]=0;
while (!q.empty()) {
int u=q.front(); q.pop();
if (u==v) break;
for (auto v:adj[u]) {
if (!vis[v]) {
vis[v]=1;
dist[v]=dist[u]+1;
q.push(v);
}
}
}
if (dist[v]==-1) cout<<"impossible\n";
else cout<<dist[v]<<'\n';
dist.assign(n,-1);
vis.assign(n,0);
}
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
}
