#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <complex>

using namespace std;

const int MAX_V = 1001;
// d[u][v]Íu©çvÖÌRXgBßÉ×Ú·éGbWÌRXgðüêÄ¨¢½è·êÎæ¢Í¸B
int d[MAX_V][MAX_V];
const int INF=1000000000;
// ¸_
int V;

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b))<EPS)

// prv[i][j] -> iªX^[gn_ÌÆ«Aj©çÇ±Éßé©
int prv[MAX_V][MAX_V];

// S_ÎÅZoHâèðÆ­O(V^3)AÓª ÁÄà®ì
void warshall_floyd(){
    for(int i = 0; i < V; i++){
        for(int j = 0; j < V; j++){
            for(int k = 0; k < V; k++){
                //d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
                if(d[j][k]>d[j][i]+d[i][k]){
                    int cp=k;
                    // XV
                    while(1){
                        prv[j][cp]=prv[i][cp];
                        cp=prv[i][cp];
                        if(cp==i)break;
                    }
                    d[j][k]=d[j][i]+d[i][k];
                }
            }
        }
    }
}

typedef complex<double> P;
int main(){
    int n;
    while(cin>>n&&n!=0){
        V=n;
        for(int i = 0; i < MAX_V; i++){
            for(int j = 0; j < MAX_V; j++){
                if(i==j)d[i][j]=0;
                else d[i][j]=INF;
                prv[i][j]=INF;
            }
        }
        int billNum[MAX_V];
        P billP[MAX_V];
        for(int i=0;i<n;i++){
            int x,y;
            cin>>billNum[i]>>x>>y;
            billP[i]=P(x,y);
            billNum[i]--;
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                double dist=abs(billP[i]-billP[j]);
                // £ª50ÈºÈç¹ðìéÆ¯ÉAßèûðüêÄ¨­
                if(dist<50||EQ(dist,50)){
                    d[i][j]=dist;
                    prv[i][j]=i;
                }
            }
        }
        warshall_floyd();
        int m;
        cin>>m;
        for(int i=0;i<m;i++){
            int s,g;
            cin>>s>>g;
            s--;g--;
            if(d[s][g]==INF)
                cout<<"NA"<<endl;
            else{
                vector<int> v;
                int cp=g;
                while(1){
                    v.push_back(cp+1);
                    if(cp==s)
                        break;
                    cp=prv[s][cp];
                }
                for(int i = v.size()-1; i >= 0; i--){
                    cout<<v[i];
                    if(i==0)cout<<endl;
                    else cout<<" ";
                }
            }
        }
    }

  return 0;
}