#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define ii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define vvii vector<vector<ii>>
#define pb push_back
#define vpi vector<ii>
#define forcin for(int i = 0; i<n; ++i) cin>>v[i];
#define ld long double
#define all(a) (a).begin(),(a).end()
#define For(i, n, x) for (int i = x; i < n; i++)
#define rsz(a,x) assign(a,x)
const int MAXN = 1e5+5;
vvii table(MAXN,vpi(25,{0,0}));
struct Segment{
int s,e,idx;
};
ii query(int l,int r){
int len = r-l+1;
int k = 31- __builtin_clz(len);
return max(table[l][k], table[r-(1<<k)+1][k]);
}
bool cmp(Segment a, Segment b){
if(a.s == b.s) return a.e <= b.e;
return a.s < b.s;
}
bool cmp1(Segment a, Segment b){
if(a.s == b.s) return a.e > b.e;
return a.s < b.s;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,q; cin>>n>>q;
vector<Segment> v(n);
vpi start;
For(i,n,0){
int s,e; cin>>s>>e;
v[i].s = s; v[i].e = e; v[i].idx = i;
start.pb({s,i+1});
}
sort(all(v),cmp);
vi idxs(n+1);
vvi jump(n+1,vi(25,n));
For(i,n,0) table[i][0] = {v[i].e,i};
For(k,25,1){
for(int i = 0; i+ (1<<k) -1< n; i++){
int x = i+(1<<(k-1));
table[i][k] = max(table[i][k-1],table[x][k-1]);
}
}
For(i,n,0){
Segment S; S.s = v[i].e; S.e = 1e9; S.idx = 1e9;
int idx = (upper_bound(all(v),S,cmp) - v.begin());
idx--;
//cerr<<i<<" "<<idx<<" "<<S.s<<" "<<S.e<<" "<<S.idx<<" "<<v[idx].s<<" "<<v[idx].e<<" "<<v[idx].idx<<endl;
/*if(idx == i){
jump[v[i].idx][0] = 0; continue;
}*/
ii p = query(0,idx);
if(p.s == i) jump[i][0] = n;
else jump[i][0] = p.s;
}
//Build Binary Lifting
For(k,25,1){
For(i,n,0){
jump[i][k] = jump[jump[i][k-1]][k-1];
if(jump[i][k] == i || jump[i][k] == jump[i][k-1]) jump[i][k] = n;
}
}
For(i,n,0) idxs[v[i].idx] = i;
/*For(i,n,0){
cerr<<i<<" "<<v[i].s<<" "<<v[i].e<<" "<<v[i].idx<<endl;
cerr<<jump[i][0]<<" "<<jump[i][1]<<" "<<jump[i][2]<<endl<<endl;
}*/
while(q--){
int s,e; cin>>s>>e; s--,e--;s = idxs[s]; e = idxs[e];
if(s == e){
cout<<0<<endl; continue;
}
//cerr<<s<<" "<<e<<" ";
int ans = 0;
for(int i = 24; i>=0; i--){
if(jump[s][i] != n && jump[s][i] < e){
s = jump[s][i];
ans+=(1ll<<i);
}
}
//cerr<<"ANS "<<s<<" "<<jump[s][0]<<" "<<e<<endl;
if(max(e,s) ==n || !(v[e].s <= v[s].e && v[s].e <= v[e].e)) cout<<"impossible"<<endl;
else cout<<ans+1<<endl;
}
}
