#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;
const int logg = 21;
int n, q;
int L[maxn], R[maxn], x[maxn];
namespace sub3{
vector<int> adj[maxn];
int dist[maxn];
int DJK(int root){
for(int i = 1; i <= n; i++) dist[i] = oo;
dist[root] = 0;
queue<int> q;
q.push(root);
while(!q.empty()){
int u = q.front(); q.pop();
for(int v : adj[u]){
if(dist[v] > dist[u] + 1){
dist[v] = dist[u] + 1;
q.push(v);
}
}
}
int mx = 0;
for(int i = 1; i <= n; i++){
mx = max(mx, dist[i]);
if(dist[i] == oo) return -1;
}
return mx;
}
void Solve(void){
for(int i = 1; i <= n; i++){
for(int j = L[i]; j <= R[i]; j++){
adj[i].push_back(j);
}
}
while(q--){
int x;
cin >> x;
cout << DJK(x) << '\n';
}
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen ("tree.inp" , "r" ,stdin);
//freopen ("tree.out" , "w" ,stdout);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> L[i] >> R[i];
}
cin >> q;
sub3 :: Solve();
return 0;
}
