#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ar2 = array<int,2>;
using ar3 = array<int,3>;
using ll = long long;
const int mxN = (int)1e5+10;
const int INF = mxN;
int n, q;
int L[mxN], R[mxN];
//int dis[mxN][mxN];
bitset<mxN> vis;
vector<int> adj[mxN];
vector<int> events[mxN*2][2];
int dep[mxN], comp[mxN];

void bfs(int s){
	/*queue<int> Q;
	vis.reset();
	fill(dis[s],dis[s]+n+1,INF);
	dis[s][s] = 0; vis[s] = 1; Q.push(s);
	while(sz(Q)){
		auto a = Q.front(); Q.pop();
		for(auto b : adj[a]){
			if(vis[b]) continue;
			vis[b] = 1; Q.push(b);
			dis[s][b] = dis[s][a]+1;
		}
	}*/
}

int Dis(int s, int t){
	if(s==t) return 0;
	if(comp[s]!=comp[t]) return INF;
	if(dep[s]>dep[t]) return INF;
	return abs(dep[s]-dep[t]);
	//return dis[s][t];
}

void dfs(int s, int p){
	dep[s] = dep[p]+1;
	comp[s] = (!p?s:comp[p]);
	for(auto u : adj[s]){
		if(u==p) continue;
		dfs(u,s);
	}
}

int32_t main()
{
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> q; vector<int> v;
	for(int i = 1; i <= n; i++){
		cin >> L[i] >> R[i];
		v.pb(L[i]),v.pb(R[i]);
	}
	sort(all(v)); v.erase(unique(all(v)),end(v));
	for(int i = 1; i <= n; i++){
		L[i] = lower_bound(all(v),L[i])-begin(v);
		R[i] = lower_bound(all(v),R[i])-begin(v);
		events[L[i]][1].pb(i); events[R[i]][0].pb(i);
	}
	vector<int> open;
	for(int _ = 0; _ <= n*2; _++){
		for(auto i : events[_][1]){
			open.pb(i);
		}
		for(auto i : events[_][0]){
			for(auto j : open) 
				if(i!=j) adj[i].pb(j);
		}
		for(auto i : events[_][0]){
			open.erase(find(all(open),i));
		}
	}
	for(int i = 1; i <= n; i++) 
		if(sz(adj[i])==1 and !comp[i]) dfs(i,0);
	//for(int i = 1; i <= n; i++) bfs(i);
	for(int i = 0; i < q; i++){
		int s, t; cin >> s >> t;
		int ans = Dis(s,t);
		if(ans==INF){cout<<"impossible\n"; continue; }
		cout << ans << "\n";
	}
}