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 <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<int, string> PSI;

int n, m;

int b[1100];
double x[1100], y[1100];
int s, g;

double d[1100];
int pre[1100];

double distance(double x1, double y1, double x2, double y2){
	return sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
}

struct edge{
	int to;
	double cost;
};

vector<edge> ve[1100];

void djikstra(){
	fill(d, d + 1100, INF);
	fill(pre, pre + 1100, -1);

	priority_queue< pair<double,int> > que;
	
	d[s] = 0;
	que.push({ d[s], s });

	while (!que.empty()){
		pair<double, int> p = que.top();
		que.pop();
		int v = p.second;

		if (d[v] < p.first)continue;

		REP(i, ve[v].size()){
			edge e = ve[v][i];
			if (d[e.to] > d[v] + e.cost){
				d[e.to] = d[v] + e.cost;
				que.push({ d[e.to], e.to });
				pre[e.to] = v;
			}
		}
	}
}

int main(){
	while (cin >> n&&n){
		REP(i, 1100)ve[i].clear();
		REP(i, n){
			cin >> b[i] >> x[i] >> y[i];
		}
		REP(i, n){
			REP(j, n){
				double dis = distance(x[i], y[i], x[j], y[j]);
				if (i != j&&dis - 50 < EPS){
					ve[b[i]].push_back({ b[j], dis });
				}
			}
		}
		cin >> m;
		REP(i, m){
			cin >> s >> g;
			djikstra();
			int v = g;
			if (pre[v] == -1){
				cout << "NA" << endl;
				continue;
			}
			vector<int> vi;
			vi.push_back(g);
			while (pre[v] != -1){
				vi.push_back(pre[v]);
				v = pre[v];
			}
			reverse(ALL(vi));
			REP(i, vi.size()){
				if (i == 0)cout << vi[i];
				else cout << " " << vi[i];
			}
			cout << endl;
		}
	}
}

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<pdi> 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 (pdi (-d[v], v ) );
				path[v] = u;
			} // end if
		} // end rep
	} // end while

	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
}

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

		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;
}