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<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<double,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip	;
const double PI=acos(-1);
const double EPS=1e-6;
const int inf=1e8;
class DIJ{
	public:
	struct edge{
		int to;
		double cost;
	};
	vector<vector<edge> >G;
	int n;
	vector<double> d;//distance
	DIJ(int size){
		n=size;
		G=vector<vector<edge> >(n);
	}
	void add_edge(int a,int b,double c){
		edge e={b,c},ee={a,c};
		G[a].pb(e);
		G[b].pb(ee);
	}
	void dij(int s){
		d=vector<double>(n,inf);
		d[s]=0;
		priority_queue<pii>q;
		q.push(pii(0,s));
		while(!q.empty()){
			pii p=q.top();
			q.pop();
			int pos=p.second;
			double cost=-p.first;
			if(cost>d[pos])continue;
			rep(i,G[pos].size()){
				edge e=G[pos][i];
				int to=e.to;
				double nowcost=cost+e.cost;
				if(nowcost<d[to]){
					d[to]=nowcost;
					q.push(pii(-d[to],to));
				}
			}
		}
	}
};
int main(){
	int n;
	while(cin>>n,n){
		vi m(n);
		vi nu(n);
		vp in(n);
		rep(i,n){
			int a,b,c;
			cin>>a>>b>>c;
			m[i]=a;
			in[i]=pair<int,int>(b,c);
		}
		DIJ dij(n);
		rep(i,n)rep(j,i)if(i!=j&&hypot(in[i].first-in[j].first,in[i].second-in[j].second)<EPS+50)dij.add_edge(i,j,hypot(in[i].first-in[j].first,in[i].second-in[j].second));
		int N;
		cin>>N;
		while(N--){
			int a,b;
			cin>>a>>b;
			a--;b--;
			dij.dij(a);
			if(abs(dij.d[b]-inf)<EPS)cout<<"NA"<<endl;
			else{
				vi out;
				out.pb(b);
				int t=b;
				while(1){
					rep(i,n)rep(j,dij.G[i].size()){
						if(t==dij.G[i][j].to&&abs(dij.d[i]+dij.G[i][j].cost-dij.d[t])<EPS){
							out.pb(i);
							t=i;
							goto end;
						}
					}
					end:;
					if(out[out.size()-1]==a)break;
				}
				for(int i=out.size()-1;i>=0;i--)cout<<m[out[i]]<<(i?" ":"\n");
			}
		}
	}
}

C++: #include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
#define sqr(x) ((x) * (x))
using namespace std;
int n, q, s, t, b[1009], x[1009], y[1009];
int main() {
	while (cin >> n, n) {
		for (int i = 0; i < n; i++) cin >> b[i] >> x[i] >> y[i];
		vector<vector<int> > G(n);
		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				if (sqr(x[i] - x[j]) + sqr(y[i] - y[j]) <= 2500) {
					G[i].push_back(j);
					G[j].push_back(i);
				}
			}
		}
		cin >> q;
		while (q--) {
			cin >> s >> t;
			for (int i = 0; i < n; i++) {
				if (b[i] == s) {
					s = i; break;
				}
			}
			for (int i = 0; i < n; i++) {
				if (b[i] == t) {
					t = i; break;
				}
			}
			vector<double> dist(n, 1.0e+10); dist[s] = 0.0;
			vector<int> pre(n, -1);
			queue<pair<double, int> > que; que.push(make_pair(0.0, s));
			while (!que.empty()) {
				int u = que.front().second; que.pop();
				for (int e : G[u]) {
					double d2 = hypot((double)(x[u] - x[e]), (double)(y[u] - y[e]));
					if (dist[e] > dist[u] + d2) {
						dist[e] = dist[u] + d2;
						pre[e] = u;
						que.push(make_pair(-dist[e], e));
					}
				}
			}
			if (dist[t] >= 9.0e+9) cout << "NA" << endl;
			else {
				vector<int> ret;
				while (t != s) {
					ret.push_back(b[t]);
					t = pre[t];
				}
				reverse(ret.begin(), ret.end());
				cout << b[s];
				for (int i : ret) cout << ' ' << i;
				cout << endl;
			}
		}
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
#include <map>
#include <queue>
#include <climits>
#include <algorithm>
using namespace std;
typedef pair<double,double> P;
typedef pair<double,int> NODE;
#define X first
#define Y second
#define DST first
#define POS second
double ecd(P A,P B){
	A.X = fabs(A.X-B.X);
	A.Y = fabs(A.Y-B.Y);
	return sqrt(A.X*A.X+A.Y*A.Y);
}


int main(){
	int n,a,b,m;
	double x,y;
	while(cin >> n && n){
		map<int,P> coord;
		map<int,int> from;
		map<int,vector< pair<int,double> > > info;
		map<int,double> memo;
		for(int i=0;i<n;i++){
			cin >> a >> x >> y;
			coord[a] = make_pair(x,y);
		}
		
		for(map<int,P>::iterator it1 = coord.begin();it1 != coord.end();it1++){
			for(map<int,P>::iterator it2 = coord.begin();it2 != coord.end();it2++){
				if(ecd((*it1).second,(*it2).second) <= 50.0)
					info[(*it1).first].push_back( make_pair((*it2).first,ecd((*it1).second,(*it2).second)));
			}
			memo[(*it1).first] = (1<<25);
		}

		cin >> m;
		
		for(int i=0;i<m;i++){
			cin >> a >> b;
			vector<int> way;
			priority_queue<NODE,vector<NODE>,greater<NODE> > Q;
			Q.push(make_pair(0,a));
			memo[a]=0;
			from[a]=-1;
			while(Q.size()){
				NODE q = Q.top();Q.pop();
				if(q.POS == b){
					int p = q.POS;
					while(~p){
						way.push_back(p);
						p = from[p];
					}
					break;
				}
				for(int i=0;i<info[q.POS].size();i++){
					if(memo[info[q.POS][i].first] > q.DST + info[q.POS][i].second){
						memo[info[q.POS][i].first] = q.DST + info[q.POS][i].second;
						from[info[q.POS][i].first] = q.POS;
						Q.push(make_pair(memo[info[q.POS][i].first],info[q.POS][i].first));
					}
				}
			}
			if(way.size()){
				reverse(way.begin(),way.end());
				for(int i=0;i<way.size();i++){
					if(i)cout << " ";
					cout << way[i];
				}
			}else{
				cout << "NA";
			}
			cout << endl;
		}
	}
}