#include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdlib>
#include <ctime>
using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
typedef pair<double, int> state;

double memo[100];
int pre[100];
int name[100];
double x[100];
double y[100];

map<int, int> nums;

double dis(int i, int j){
  return sqrt((x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]));
}

int main(){
  int n, m;
  int b;
  int s, g;
  while(cin >> n &&n){
    nums.clear();
    rep(i, n){
      cin >> b >> x[i] >> y[i];
      name[i] = b;
      nums[b] = i;
    }
    cin >> m;
    rep(i, m){
      memset(pre, -1, sizeof(pre));
      fill(memo, memo + 100, 1e10);
      cin >> s >> g;
      memo[nums[s]] = 0;
      priority_queue<state, vector<state>, greater<state> > que;
      que.push(state(0, nums[s]));
      while(!que.empty()){
	state st = que.top();
	que.pop();
	int v = st.second;
	double cost = st.first;
	if(name[v] == g){
	  break;
	}
	if(cost > memo[v]) continue;
	rep(i, n){
	  double d = dis(v, i);
	  if(d > 50.0) continue;
	  if(memo[i] > memo[v] + d){
	    memo[i] = memo[v] + d;
	    pre[i] = v;
	    que.push(state(memo[i], i));
	  }
	}
      }
      if(pre[nums[g]] == -1 && s != g){
	cout << "NA" << endl;
      }else{
	vector<int> res;
	int v = nums[g];
	res.push_back(v);
	while(pre[v] >= 0){
	  v = pre[v];
	  res.push_back(v);
	}
	rep(i, (int)res.size()){
	  if(i != 0) cout << " " ;
	  cout << name[res[res.size() - 1 - i]];
	}
	cout << endl;
      }
    }
  }
  return 0;
}