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 <iomanip>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define rep(i,n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 

 
const int INF = 1000000;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
//const double D_INF = 1e18;

const double PI = acos(-1);

int dx[] ={-1,0,1,0};
int dy[] ={0,-1,0,1};

struct Edge
{
	int t, c;
	Edge(){};
	Edge(int t, int c) : t(t), c(c){};
};

int n;
int b[1010], x[1010], y[1010];
vector<Edge> edge[1010];

pair<int, int> d[1010];
bool used[1010];
vi ans;

void dijkstra(int s){
	rep(i, 1010){
		d[i] = mp(INF, -1);
		used[i] = false;
	}
	d[s].fi = 0;
	priority_queue<pii, vector<pii>, greater<pii> > q;
	pii p;
	q.push(mp(0, s));
	int from, to, cost;
	while(!q.empty()){
		p = q.top(); q.pop();
		from = p.se;
		//cost = p.fi;
		if(d[from].fi<p.fi) continue;
		cost = d[from].fi;
		used[from] = true;
		auto e = edge[from];
		for(int i = 0; i < e.size(); i++){
			to = e[i].t;
			//if(used[to]) continue;
			if(d[to].fi > cost+e[i].c){
				d[to].fi = cost+e[i].c;
				d[to].se = from;
				q.push(mp(d[to].fi, to));
			}
		}
	}
}

int main(){
	int m, dx, dy;
	while(cin>>n && n){
		//cout<<n<<endl;
		rep(i, 1010){
			b[i]=x[i]=y[i] = -1;
			d[i] = mp(INF, -1);
			used[i] = false;
			edge[i].clear();
		}
		rep(i, n) cin>>b[i]>>x[i]>>y[i];
		for(int i = 0; i < 1010; i++){
			if(b[i] == -1 || x[i] == -1 || y[i]== -1) continue;
			for(int j = i + 1; j < 1010; j++){
				if(b[j] == -1 || x[j] == -1 || y[j] == -1) continue;
				dx = x[i]-x[j];
				dy = y[i]-y[j];
				if(dx*dx+dy*dy>2500)continue;
				edge[b[i]].push_back(Edge(b[j], dx*dx+dy*dy));
				edge[b[j]].push_back(Edge(b[i], dx*dx+dy*dy));
			}
		}
		//cout<<edge[1][0].t<<" "<<edge[1][0].c<<endl;
		//cout<<edge[2][0].t<<" "<<edge[2][0].c<<endl;

		cin>>m;
		rep(i, m){
			int s, g;
			cin>>s>>g;
			//cout<<s<<" "<<g<<endl;
			dijkstra(s);
			if(d[g].fi==INF) {
				cout<<"NA"<<endl;
				continue;
			}
			ans.clear();
			//bool usedG[1010]={};
			while(1){
				ans.pb(g);
				if(g == s /*|| g == -1*/) break;
				//usedG[g] = true;
				g = d[g].se;
				//if(usedG[g]) break;
				//cout<<"  "<<g<<endl;
			}
			//while(ans.size()> 0 && ans.back()==-1) ans.pop_back();
			reverse(all(ans));
			rep(j, ans.size()){
				if(j != 0) cout<<" ";
				cout<<ans[j];
			}
			cout<<endl;
		}
	}
}

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);
		vector<pair<int,int> > 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");
			}
		}
	}
}