#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define pll pair <ll, ll>
#define boost() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sz(x) (int)x.size()
using namespace std;
const int N = 1e3+123;
const ll mod = 1e9+7;
// vector<int> g[N];
// int used[N];
// void dfs(int v , int p){
// for(int to : g[v]){
// if(to != p){
// dfs(to);
// }
// }
// }
void solve() {
int n,q;
cin >> n >> q;
pii a[n+1];
//pii qr[q+1];
for(int i=1 ; i <= n ; i++){
int x;
cin >> x >> a[i].F;
a[i].S=i;
}
sort(a+1 , a+1+n);
for(int i=1 ; i <= q ; i++){
int x,y;
cin >> x >> y;
//cin >> qr[i].F >> qr[i].S;
if(x != a[1].S || y != a[n].S){
cout << "impossible\n";
} else{
cout << n-1 << endl;
}
}
}
signed main() {
boost();
int tt=1;
//cin >> tt;
while (tt--) {
solve();
}
return 0;
}
