#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct Bill
{
	int b, x, y;
};

#define SQR(x) ((x) * (x))
const int INF = 1 << 30;

int prv[1024];
bool dijkstra(vector<Bill>& bill, vint& ntoi, int s, int t)
{
	int V = bill.size();
	
	vint used(V, false);
	vint d(V, INF);
	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;
		
		rep(u, V) if(SQR(bill[v].x - bill[u].x) + SQR(bill[v].y - bill[u].y) <= 2500)
		{
			if(d[v] + 1 < d[u])
			{
				d[u] = d[v] + SQR(bill[v].x - bill[u].x) + SQR(bill[v].y - bill[u].y);
				prv[u] = v;
			}
		}
	}
	
	return d[t] == INF;
}

int main()
{
    int n;
	
	while(cin >> n && n)
	{
		vector<Bill> bill(n);
		vint ntoi(1001, -1);
		rep(i, n)
		{
			cin >> bill[i].b >> bill[i].x >> bill[i].y;
			ntoi[bill[i].b] = i;
		}
		
		int m;
		cin >> m;
		rep(i, m)
		{
			int s, b;
			cin >> s >> b;
			
			memset(prv, -1, sizeof prv);
			
			if(dijkstra(bill, ntoi, ntoi[s], ntoi[b]))
			{
				cout << "NA" << endl;
			}
			else
			{
				vint path;
				for(int t = ntoi[b]; t != -1; t = prv[t]) path.push_back(bill[t].b);
				
				reverse(ALL(path));
				
				rep(i, path.size()) cout << path[i] << (i + 1 == path.size() ? "\n" : " ");
			}
		}
	}
}