#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define P pair
#define pi P<int,int>
#define ff first
#define ss second
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define V vector
#define vi V<int>
#define v2i V<vi>
#define v3i V<v2i>
#define vpi V<pi>
#define vsi V<si>
#define vb V<bool>
#define pb push_back
#define si set<int>
#define ins insert
#define mii map<int,int>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
const int INF=1e18;

int n,q;
vpi evs;
v2i jmp;

template<class T>
struct RMQ {
	vector<vector<T>> jmp;
	RMQ(const vector<T>& V) : jmp(1, V) {
		for (int pw = 1, k = 1; pw * 2 <= sz(V); pw *= 2, ++k) {
			jmp.emplace_back(sz(V) - pw * 2 + 1);
			rep(j,0,sz(jmp[k]))
				jmp[k][j] = comb(jmp[k - 1][j], jmp[k - 1][j + pw]);
		}
	}
	T query(int a, int b) {
		assert(a < b); // or return inf if a == b
		int dep = 31 - __builtin_clz(b - a);
		return comb(jmp[dep][a], jmp[dep][b - (1 << dep)]);
	}
	T comb(T a, T b) {
		if (a==INF) return b;
		if (b==INF) return a;
		if (evs[a].ff<evs[b].ff) return a;
		return b;
	}
};

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin>>n>>q; evs=vpi(n); si rev; jmp=v2i(n,vi(30,0));
	for (int i=0; i<n; i++) {
		cin>>evs[i].ff>>evs[i].ss;
		rev.ins(evs[i].ff); rev.ins(evs[i].ss);
	}
	mii cmp; int c=0;
	for (auto i:rev) {cmp[i]=c; c++;}
	for (int i=0; i<n; i++) {
		evs[i].ff=cmp[evs[i].ff];
		evs[i].ss=cmp[evs[i].ss];
	}
	vi ses(c,INF);
	for (int i=0; i<n; i++) {
		int pos=evs[i].ss;
		if (ses[pos]==INF || evs[ses[pos]].ff>evs[i].ff) {
			ses[pos]=i;
		}
	}
	RMQ<int> rmqse(ses);
	for (int i=0; i<n; i++) {
		int x=rmqse.query(evs[i].ff,evs[i].ss+1);
		jmp[i][0]=x;
	}
	while (q--) {
		int s,e; cin>>s>>e; s--; e--;
		if (s==e) {
			cout<<"0\n"; continue;
		}
		int cp=e;
		int num=0; bool ok=0;
		while (true) {
			if (evs[jmp[cp][0]].ff>evs[s].ff) {
				if (cp==jmp[cp][0]) {break;}
				cp=jmp[cp][0];
				num++;
			} else {
				break;
			}
		}
		for (int i=0; i<5; i++) {
			if (evs[cp].ff<=evs[s].ss && evs[s].ss<=evs[cp].ss) {
				num++; ok=1; break;
			} else {
				num++; cp=jmp[cp][0];
			}
		}
		if (ok) {
			cout<<num<<"\n";
		} else {
			cout<<"impossible\n";
		}
	}

	return 0;
}