#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)

#define MAX 1010

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

int n;
double cost[MAX][MAX];
int num[MAX];
vector<pair<int, int> > vv;

int prev[MAX];
double d[MAX];
bool used[MAX];
int V;

void dijkstra(int s){
    fill(d, d+V, inf);
    fill(used, used+V, false);
    fill(prev, prev+V, -1);
    d[s] = 0;

    while(true){
        int v = -1;
        for(int u=0; u < V; u++){
            if(!used[u] && (v==-1 || d[u] < d[v])) v = u;
        }

        if(v == -1)break;
        used[v] = true;

        for(int u=0; u < V; u++){
            if(d[u] > d[v] + cost[v][u]){
                d[u] = d[v] + cost[v][u];
                prev[u] = v;
            }
        }
    }
}

vector<int> get_path(int t){
    vector<int> path;
    for(; t != -1; t = prev[t]) path.push_back(t);
    reverse(path.begin(), path.end());
    return path;
}

int main(){
    while(cin >> n, n){
        V = n;
        vv.clear();
        rep(i, n){
            int b, x, y;
            cin >> b >> x >> y;
            num[i] = b; vv.push_back(make_pair(x, y));
        }
        rep(i, n)rep(j, n){
            if(i == j) {cost[i][j] = inf; continue;}
            double d = abs(sqrt(pow(vv[i].first-vv[j].first, 2)+pow(vv[i].second-vv[j].second, 2)));
            if(d-eps <= 50.0){/*cout << i << " " << j << " " << d << endl;*/ cost[i][j] = d;}
            else cost[i][j] = inf;
        }
        int m;
        cin >> m;
        rep(i, m){
            int s, g;
            cin >> s >> g; s--; g--;
            dijkstra(s);
            vector<int> p = get_path(g);

            if(p.size() == 1) cout << "NA" << endl;
            else {
                rep(j, p.size()) cout << (j==0?"":" ") << num[p[j]];
                cout << endl;
            }
        }
    }
}