#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define sz(v) (ll)(v.size())
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
const ll sz = 100005;
vl g[sz];
bool vis[105][sz];
ll dist[105][sz];
void dijkstra(ll node, ll org, ll n)
{
for(ll i = 0; i <= n; i++)
{
dist[node][i] = 1000000000000000;
vis[node][i] = 0;
}
dist[node][org] = 0;
queue<pll>pq;
pq.push({0, org});
while(!pq.empty())
{
ll nd = pq.front().s;
pq.pop();
if(vis[node][nd])
continue;
vis[node][nd] = 1;
for(auto u : g[nd])
{
if(dist[node][u] > dist[node][nd] + 1)
{
dist[node][u] = dist[node][nd] + 1;
pq.push({-dist[node][u], u});
}
}
}
}
void solve()
{
ll n, q, i, j;
cin >> n >> q;
pll p[n+1];
for(i = 1; i <= n; i++)
cin >> p[i].f >> p[i].s;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
if(i == j)
continue;
if(p[j].f <= p[i].s && p[i].s <= p[j].s)
g[i].pb(j);
}
}
map<ll, ll>mp;
ll t = 1;
while(q--)
{
ll x, y;
cin >> x >> y;
if(mp.find(x) == mp.end())
{
mp[x] = t;
dijkstra(t, x, n);
t++;
}
ll u = mp[x];
if(dist[u][y] == 1000000000000000)
cout << "impossible\n";
else
cout << dist[u][y] << "\n";
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll tests = 1;
//cin >> tests;
while(tests--)
{
solve();
}
}
