#include <bits/stdc++.h>
using namespace std;
//#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1000000000 + 7;
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int n, m;
struct edge{int to; double cost;};

vector<double> dijkstra(int s, int n, vector<vector<edge>>& g, vector<int> &pv){
    priority_queue<pdbi, vector<pdbi>, greater<pdbi>> que;
    vector<double> d(n, LLONG_MAX / 10.0); d[s] = 0.0;
    que.push(pdbi(0.0, s));

    while (!que.empty()){
        plli p = que.top();que.pop();
        int fr = p.second;
        if (d[fr] < p.first) continue;
        for (edge e: g[fr]){
            if (e.cost > 50.0) continue;
            if (d[e.to] > d[fr] + e.cost){
                d[e.to] = d[fr] + e.cost;
                pv[e.to] = fr;
                que.push(pdbi(d[e.to], e.to));
            }
        }
    }
    return d;
}

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

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    while (true) {
        vector<vector<edge>> g(100 + 5);
        vector<int> pv(100 + 5, -1);
        cin  >> n;
        if (n == 0) break;
        int b[105], x[105], y[105];
        rep(i, n) {
            cin >> b[i] >> x[i] >> y[i];
            b[i]--;
        }
        rep(i, n) {
            rep(j, n) {
                if (b[i] == b[j]) continue;
                double d = sqrt(pow(x[b[i]] - x[b[j]], 2) + pow(y[b[i]] - y[b[j]], 2));
                g[b[i]].push_back(edge{b[j], d});
            }
        }
        cin >> m;
        rep(i, m) {
            int s, goal;
            cin >> s >> goal;
            s--; goal--;
            vector<double> dist = dijkstra(s, n, g, pv);
            if (dist[goal] == LLONG_MAX / 10.0) {
                cout << "NA" << endl;
                continue;
            }
            vector<int> ans = get_path(goal, pv);
            int size = ans.size();
            rep(i, size) {
                if (i != size - 1) cout << ans[i] + 1 << " ";
                else cout << ans[i] + 1<< endl;
            }
        }
    }
}