Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"math"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	dd := make([][]int, 1000)
	for i := range dd {
		dd[i] = make([]int, 1000)
	}
	num := make([]int,1000)
	inv := make([]int, 1001)
	x := make([]int, 1000)
	y := make([]int, 1000)
	vv := make([]int, 1000)
	nowt := make([]float64, 1000)
	rev := make([]int, 1000)
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf1 := strings.Split(scanner.Text(), " ")
			num[i], _ = strconv.Atoi(buf1[0])
			x[i], _ = strconv.Atoi(buf1[1])
			y[i], _ = strconv.Atoi(buf1[2])
			inv[num[i]] = i
		}
		for i := 0; i < n; i++ {
			for j := 0; j < n; j++ {
				dd[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])
			}
		}
		scanner.Scan()
		m, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf2 := strings.Split(scanner.Text(), " ")
			c, _ := strconv.Atoi(buf2[0])
			d, _ := strconv.Atoi(buf2[1])
			c = inv[c]
			d = inv[d]
			for j := 0; j < n; j++ {
				vv[j] = 0
				nowt[j]=999999999
				rev[j]=-1
			}
			nowt[c]=0
			for j := 0; j < n; j++ {
				M := 99999999
				at := 0
				for k := 0; k < n; k++ {
					if vv[k] == 0 && float64(M) > nowt[k] {
						M=int(nowt[k])
						at = k
					}
				}
				if M > 90000000 {
					break
				}
				vv[at]=1
				for k := 0; k < n; k++ {
					if vv[k] == 0 && dd[at][k]<=2500&&nowt[k]>nowt[at]+math.Sqrt(float64(dd[at][k])) {
						nowt[k]=nowt[at]+math.Sqrt(float64(dd[at][k]))
						rev[k] = at
					}
				}
			}
			if vv[d] == 0 {
				fmt.Println("NA")
			} else {
				stack := make([]int, 0)
				V := d
				for V != c {
					stack = append(stack, V)
					V = rev[V]
				}
				fmt.Print(num[c])
				for len(stack) > 0 {
					fmt.Printf(" %d", num[stack[len(stack)-1]])
					stack = stack[:len(stack)-1]
				}
				fmt.Println()
			}
		}
	}
}

C++: #include<iostream>
#include<cstring>
#include<queue>
#include<cmath>
#include<stack>
using namespace std;
#define INF 1e10
#define EPS 1e-4
#define EQ(a,b) (fabs((a)-(b))<EPS)

double dist[1000][1000];
int id[1000],x[1000],y[1000];

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


int main(){
	int n;
	while(cin>>n&&n){
		for(int i=0;i<n;i++)cin>>id[i]>>x[i]>>y[i];
		for(int i=0;i<n;i++)for(int j=0;j<n;j++){
			double d=Distance(i,j);
			dist[i][j]=(d<=50?d:INF);
		}
		for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)
			dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
		int m;
		cin>>m;
		for(int i=0;i<m;i++){
			int s,g;
			cin>>s>>g;
			s--;g--;
			if(dist[s][g]==INF){
				cout<<"NA\n";
				continue;
			}
			stack<int> st;
			int v=g;
			while(v!=s){
				for(int i=0;i<n;i++){
					if(i==v)continue;
					if(EQ(dist[s][v],dist[s][i]+Distance(i,v))){
						st.push(v);
						v=i;
						break;
					}
				}
			}
			cout<<id[s];
			while(!st.empty()){
				cout<<' '<<id[st.top()];
				st.pop();
			}
			cout<<endl;
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define INF (1<<29)
#define EPS (1e-8)

int main() {
	int n;
	while (cin >> n, n) {
		vector<pair<double, double> > buil(n);
		vector<int> num(n);
		
		REP(i, n) scanf("%d %lf %lf", &num[i], &buil[i].first, &buil[i].second);
		
		vector<double> graph[n];
		REP(i, n) {
			graph[i].resize(n);
			REP(j, n) {
				if (i == j) graph[i][j] = 0.0;
				else graph[i][j] = hypot(buil[i].first - buil[j].first, buil[i].second - buil[j].second);
			}
		}
		
		int m;
		cin >> m;
		while (m--) {
			int s, g;
			scanf("%d %d", &s, &g);
			
			int sn, gn;
			REP(i, n) {
				if (num[i] == s) sn = i;
				if (num[i] == g) gn = i;
			}
			
			vector<double> dis(n, INF);
			priority_queue<pair<double, int> > pq;
			pq.push(make_pair(0.0, sn));
			vector<int> prev(n, INF);
			
			while (!pq.empty()) {
				pair<double, int> now = pq.top();
				pq.pop();
				
				int from = now.second;
				
				REP(i, n) {
					if (graph[from][i] <= 50 + EPS ) {
						double d = now.first + graph[from][i];
						if (dis[i] > d) {
							dis[i] = d;
							prev[i] = from;
							pq.push(make_pair(d, i));
						}
					}
				}
			}
			
			if (dis[gn] == INF) puts("NA");
			else {
				vector<int> ans;
				int pos = gn;
				
				while (pos != sn) {
					ans.push_back(num[pos]);
					pos = prev[pos];
				}
				ans.push_back(num[sn]);
				reverse(ans.begin(), ans.end());
				REP(i, ans.size()) printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
			}
		}
		
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs
#include <cstdio>	// require printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>	// require tolower, toupper
#include <fstream>	// require freopen
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define DEBUG 0

using namespace std;

typedef long long ll;
typedef pair<double, int> P;
//typedef pair<double, int> pdi;

const int INF = 1000000000;

double adj[1005][1005];
int path[1005];
double d[1005];
int n;
bool visit[1005];

// ノード:s からの最短距離を求める
bool dijkstra (int s, int t )
{
	memset (path, -1, sizeof (d ) );
	memset (visit, false, sizeof (visit ) );
	// greater<P> を指定することでfirstが小さい順に取り出せるようにする
//	priority_queue<P, vector<P>, greater<P> > que;
	priority_queue<P> que;

	fill (d,  d + n, INF );
	d[s] = 0.0;
	que.push (P (0.0, s ) );
		
	while (!que.empty() ){
		P p = que.top(); que.pop();
		int u = p.second;
		if (u == t ) return true;
		visit[u] = true;
		if (d[u] < p.first ) continue;
		rep (v, n ){
			if (visit[v] ) continue;
			if (d[v] > d[u] + adj[u][v] ){
				d[v] = d[u] + adj[u][v];
				que.push (P (-d[v], v ) );
				path[v] = u;
			} // end if
		} // end rep
	} // end while

// for debug
#if DEBUG
	cout << "path: " << endl;
	rep (i, n ){
		cout << setw(2) << path[i];
	} // end rep
	cout << endl;
	cout << "dis: " << endl;
	rep (i, n ){
		cout << d[i] << ' ';
	} // end rep
	cout << endl;
#endif
	return false; 
}

void disp_path (int s, int t )
{
	vector<int> res;
	res.push_back (t );
	int curr = t;
	while (path[curr] != -1 ){
		curr = path[curr];
		res.push_back (curr );
	} // end while

	reverse (ALL (res ) );
	rep (i, res.size() ){
		cout << res[i] + 1 << (i != res.size() - 1 ? ' ' : '\n' );
	} // end rep
}

void disp_adj (void )
{
	rep (i, n+1 ){
		printf ("%-7d", i );
	} // end rep
	printf ("\n" );

	rep (i, n ){
		printf ("%-7d", i+1);
		rep (j, n ){
			if (adj[i][j] == INF ){
				printf ("INF   " );
			}else{
				printf ("%2.3lf", adj[i][j] );
			} // end if
		} // end rep
		printf ("\n" );
	} // end rep
}

int main()
{
//	cut here before submit 
//	freopen ("testcase.spiderjin", "r", stdin );

	while (scanf ("%d", &n ) && n != 0 ){
//		memset (adj, -1, sizeof (adj ) );
		rep (i, n ) rep (j, n ) adj[i][j] = INF;
		vector<P> p;
		p.clear();
		rep (i, n ){
			int id, x, y;
			scanf ("%d %d %d", &id, &x, &y );
			p.push_back (P (x, y ) );
		} // end rep

		rep (i, n ){
			rep (j, n ){
				if (i == j ) continue;
				int xx = p[i].first - p[j].first;
				int yy = p[i].second - p[j].second;
				int dis = xx*xx + yy*yy;
				if (dis <= 50*50 ){
					adj[i][j] = sqrt (dis );
					adj[j][i] = sqrt (dis );
				} // end if
			} // end rep
		} // end rep
 
		disp_adj ();

		int m;
		scanf ("%d", &m );
		rep (i, m ){
			int s, t;
			scanf ("%d %d", &s, &t );
			s--, t--;
			if (dijkstra (s, t ) ){
				disp_path (s, t );
			}else{
				printf ("NA\n" );
			} // end if
		} // end rep
	} // end while
	
	return 0;
}