#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int n,q;
vector<pair<pi,int>> arr;
vvi paths(1e5+5);
void solve()
{
cin >> n >> q;
FOR(i,0,n){
int a,b;cin >> a >> b;
arr.pb({{b,a},i+1});
}
sort(arr.rbegin(),arr.rend());
FOR(i,0,n){
FOR(j,0,n){
if(i == j)continue;
// cerr << i << " " << j << " " << arr[j].F.F << " " << arr[i].F.S << " " << arr[i].F.F << endl;
if(arr[i].F.S <= arr[j].F.F && arr[i].F.F >= arr[j].F.F){
paths[arr[j].S].pb(arr[i].S);
}
else{
if(j>i)break;
}
}
}
// FOR(i,1,n+1){
// cerr << i << " -> ";
// for(int j:paths[i])cerr << j << " ";
// cerr << endl;
// }cerr << endl;
FOR(i,0,q){
int a,b;cin >> a >> b;
vi visited(n+2,0);
vi dist(n+2,1e9);
priority_queue<pi> pq;
pq.push({0,a});
dist[a] = 0;
while(!pq.empty()){
int c = pq.top().S;pq.pop();
if(visited[c])continue;
visited[c] = 1;
for(int d:paths[c]){
if(dist[d] > dist[c] + 1){
dist[d] = dist[c] + 1;
pq.push({-dist[d],d});
}
}
}
// FOR(i,1,n+1){
// cerr << dist[i] << " ";
// }cerr << endl;
if(dist[b] == 1e9)cout << "impossible" << endl;
else cout << dist[b] << endl;
}
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
