#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

#define MAX 1100
#define INF (1<<29)
#define EPS 1e-9

struct Point{
  int x, y, id;
};

vector<Point> bill;
double dist[MAX][MAX];
int prev[MAX];
int V;

void init(){
  bill.clear();
  for(int i = 0 ; i < MAX ; i++){
    for(int j = 0 ; j < MAX ; j++){
      dist[i][j] = INF;
      if(i == j) dist[i][j] = 0;
    }
  }
}

void dijkstra(int s){
  int d[MAX];
  bool used[MAX];
  fill(d, d+MAX, INF);
  fill(used, used+MAX, false);
  fill(prev, prev+MAX, -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] + dist[v][u]){
	d[u] = d[v] + dist[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;
}

double getDist(int from, int to){
  double ret = sqrt( ((bill[from].x - bill[to].x)*(bill[from].x - bill[to].x)) +
		     ((bill[from].y - bill[to].y)*(bill[from].y - bill[to].y)) );
  return ret;
}
  
int main(){
  while(cin >> V, V){
    init();
    Point p;
    for(int i = 0 ; i < V ; i++){
      cin >> p.id >> p.x >> p.y;
      p.id--;
      bill.push_back(p);
    }
    
    for(int i = 0 ; i < V ; i++){
      for(int j= i+1 ; j < V ; j++){
	double dis = getDist(bill[i].id, bill[j].id);
	//if(dis >= 50 + EPS) continue;
	if(dis <= 50 + EPS){
	dist[bill[i].id][bill[j].id] = dist[bill[j].id][bill[i].id] = dis;
	}
      }
    }
    int m;    
    cin >> m;
    int s, g;
    while(m--){
      cin >> s >> g;
      s--, g--;
      dijkstra(s);
      vector<int> ans_path = get_path(g);
      if(ans_path.size() == 1) cout << "NA" << endl;
      else{
	for(int i = 0 ; i < (int)ans_path.size() ; i++){
	  if(i == (int)ans_path.size()-1) cout << ans_path[i]+1 << endl;
	  else cout << ans_path[i]+1 << ' ';
	}
      }
    } 
  }
  return 0;
}