#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 +10;
long long n, q, s[N], e[N];
// long long dist[N][N];
vector<int> adj[N];
bool visited[N];
int comp[N], id[N];
int main() {
cin >> n >> q;
vector<pair<pair<int, int>, int>> v;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> e[i];
v.push_back({{s[i], e[i]}, i});
}
sort(v.begin(), v.end());
int c = 1, ind = 1;
comp[v[0].second] = 1;
id[v[0].second] = 1;
for(int i = 1; i < n; i++){
auto [l1, r1] = v[i - 1].first;
auto [l2, r2] = v[i].first;
if(l2 <= r1 && r1 <= r2){
comp[v[i].second] = c;
id[v[i].second] = ++ind;
}else{
comp[v[i].second] = ++c;
id[v[i].second] = ind = 1;
}
}
while(q--){
int u, v;
cin >> u >> v;
if(comp[u] != comp[v] || id[u] > id[v]){
cout << "impossible\n";
}else{
cout << id[v] - id[u] << endl;
}
}
}
