#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int inf=509;
const int maxn=1e2+9;
pii a[maxn];
int f[maxn][maxn];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(".INP","r",stdin);
//freopen(".OUT","w",stdout);
int n,q;
cin>>n>>q;
for1(i,1,n){
for1(j,1,n){
f[i][j]=inf;
}
f[i][i]=0;
}
for1(i,1,n)cin>>a[i].fi>>a[i].se;
for1(i,1,n){
for1(j,1,n){
if (i==j)continue;
if (a[j].fi<=a[i].se&&a[i].se<=a[j].se){
f[i][j]=1;
}
}
}
for1(k,1,n){
for1(i,1,n){
for1(j,1,n){
f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
}
}
}
//cout<<f[1][2]<<'\n';
for1(i,1,q){
int s,e;
cin>>s>>e;
if (f[s][e]>=inf)cout<<"impossible"<<'\n';
else cout<<f[s][e]<<'\n';
}
}
