#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
const int N=1e5+5;
int n,m;
int L[N],R[N],pos[N];
int f0[N][20],g0[N][20];
int f[N][20];
struct nd{int l,r,id;} eve[N];
bool cmp(nd x,nd y){return x.r<y.r;}
int mn=1e9,mnh;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&L[i],&R[i]);
		eve[i] = {L[i],R[i],i};
	}
	sort(eve+1,eve+n+1,cmp);
	for(int i=1;i<=n;i++){
		pos[eve[i].id] = i;
		f0[i][0] = eve[i].l;
		g0[i][0] = i;
	}
	for(int j=1;j<=17;j++)
		for(int i=1;i+(1<<j)-1<=n;i++){
			if(f0[i][j-1] < f0[i+(1<<j-1)][j-1])
				f0[i][j]=f0[i][j-1], g0[i][j]=g0[i][j-1];
			else
				f0[i][j]=f0[i+(1<<j-1)][j-1], g0[i][j]=g0[i+(1<<j-1)][j-1];
		}
	for(int i=1;i<=n;i++){
		int l=1,r=i;
		while(l<r){
			int mid = (l+r)>>1;
			if(eve[mid].r>=eve[i].l) r=mid;
			else l=mid+1;
		}
		int t = log2(i-l+1);
		if(f0[l][t] < f0[i-(1<<t)+1][t]) f[i][0]=g0[l][t];
		else f[i][0]=g0[i-(1<<t)+1][t];
	}
	for(int j=1;j<=17;j++)
		for(int i=1;i<=n;i++)
			f[i][j] = f[f[i][j-1]][j-1];
	while(m--){
		int s,t;
		scanf("%d%d",&s,&t);
		if(R[s]>R[t]) {puts("impossible"); continue;}
		int ans=0;
		int x = pos[t];
		for(int j=17;j>=0;j--)
			if(eve[f[x][j]].l>L[s]){
				ans += (1<<j);
				x = f[x][j];
			}
		if(eve[x].l>L[s]) ans++,x=f[x][0];
		if(eve[x].l>L[s]) {puts("impossible"); continue;}
		if(x!=pos[s]) ans++,x=pos[s];
		printf("%d\n",ans);
	}
	return 0;
}