// AOJ 0155
// URL: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0155

#include <iostream>
#include <sstream>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;

typedef pair <int, vector <int> > PIV;
typedef pair <double, PIV > PDV;
typedef priority_queue <PDV, vector<PDV>, greater <PDV> > QUEUE;

const double eps = 1e-12;
const double inf = (double)(1<<24);
const int size = 1001;
const string NA = "NA";
int n, m;
int b[size];
double x[size], y[size];
map <int, int> cor; // number to index
bool path[size][size];
double cost[size][size];
double min_cost[size];
int con[size][size]; // connect
int concnt[size]; // connect count

double get_distance( int x1, int y1, int x2, int y2 )
{
    double x = ( x2 - x1 ), y = ( y2 - y1 );
    return fabs( sqrt( x * x + y * y ) );
}

// dijkstra
string solve( int s_, int g_ )
{
    int start = cor[s_], goal = cor[g_];
    if ( !path[start][goal] ) return NA;

    // init
    ostringstream os;
    QUEUE Q;
    PDV start_node( 0.0, PIV( start , vector<int>() ) );
    Q.push( start_node );
    min_cost[start] = 0.0;

    // proc
    while ( !Q.empty() ) {
        PDV node = Q.top();
        Q.pop();

        // proc init
        double c = node.first;
        int ind = node.second.first;
        int number = b[ind];
        vector <int> route = node.second.second;
        route.push_back( number );

        // goal, output
        if ( number == g_ ) {
            for ( vector <int> ::iterator it = route.begin(); it != route.end(); it++ ) {
                os << *it;
                if ( it + 1 != route.end() ) os << " ";
            }
            return os.str();
        }

        // move
        for ( int i = 0; i < concnt[ind]; i++ ) {
            int next_ind = con[ind][i];
            int next_number = b[next_ind];
            double next_c = c + cost[ind][next_ind];
            if ( next_c < min_cost[next_ind] ) {
                min_cost[next_ind] = next_c;
                PDV next_node( next_c, PIV( next_ind, route ) );
                Q.push( next_node );
            }
        }
    }

    return NA;
}

int main( void )
{
    while ( cin >> n && n ) {
        // init
        cor.clear();
        for ( int i = 0; i < n; i++ ) {
            concnt[i] = 0;
            for ( int j = 0; j < n; j++ ) {
                cost[i][j] = inf;
                path[i][j] = false;
            }
        }

        // input
        for ( int i = 0; i < n; i++ ) {
            cin >> b[i] >> x[i] >> y[i];
            cor[b[i]] = i;
        }

        // proc
        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( i == j ) continue;
                cost[i][j] = get_distance( x[i], y[i], x[j], y[j] );
            }
        }

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( i == j ) continue;
                if ( cost[i][j] < 50.0 + eps ) {
                    path[i][j] = true;
                    con[i][concnt[i]++] = j;
                }
            }
        }

        // floyd-warshall
        for ( int k = 0; k < n; k++ ) {
            for ( int i = 0; i < n; i++ ) {
                for ( int j = 0; j < n; j++ ) {
                    if ( i == k || k == j || j == i ) continue;
                    if ( path[i][k] && path[k][j] ) path[i][j] = true;
                }
            }
        }

        // query
        cin >> m;
        for ( int i = 0; i < m; i++ ) {
            for ( int j = 0; j < n; j++ ) min_cost[j] = inf;
            int s, t;
            cin >> s >> t;
            cout << solve( s, t ) << endl;
        }
    }
    return 0;
}

Measured memory_bytes: 0