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){
	d[s].fi = 0;
	priority_queue<pii, vector<pii>, greater<pii> > q;
	pii p;
	q.push({0, s});
	int from, to, cost;
	while(!q.empty()){
		p = q.top(); q.pop();
		from = p.se;
		cost = p.fi;
		used[from] = true;
		for(int i = 0; i < edge[from].size(); i++){
			to = edge[from][i].t;
			if(used[to]) continue;
			if(d[to].fi > cost+edge[from][i].c){
				d[to].fi = cost+edge[from][i].c;
				d[to].se = from;
				q.push({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(x[i] == -1 || y[i]== -1) continue;
			for(int j = i + 1; j < 1010; j++){
				if(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({b[j], dx*dx+dy*dy});
				edge[b[j]].push_back({b[i], dx*dx+dy*dy});
			}
		}
		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<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
using namespace std;
const int N=1001;
//near equal?
int F(double x,double y){return fabs(x-y)<1e-9;}
//IÉÜÜêévÌCfbNX
int G(const vector<int>&I,int v){return find(I.begin(),I.end(),v)-I.begin()+1;}
int main()
{
	int n,m,i,j,b,x,y,s,g,X[N],Y[N];
	static double D[N][N],V=1e10,t;
	while(scanf("%d",&n),n)
	{
		vector<int>I;	//rÌÔÌW
		for(i=0;i<n;++i)scanf("%d%d%d",&b,&x,&y),I.push_back(b),X[I.size()]=x,Y[I.size()]=y;
		for(i=1;i<=n;++i)for(j=1;j<=n;++j)D[i][j]=D[j][i]=hypot(X[i]-X[j],Y[i]-Y[j]);
		for(scanf("%d",&m);m--;)
		{
			scanf("%d%d",&s,&g);
			typedef pair<double,int>P;	//-ÅZ£AtoIndex ©firstÉ-Â¯ÄéÌYêÈ¢ÅËIftHÌless()ÅåävÈæ¤ÉI
			P p;
			priority_queue<P>q;
			double d[N];	//»ÌrÔÜÅÌÅZ£
			fill(d,d+N,V);
			//_CNXgÅÅZoHÌZo
			q.push(P(0,G(I,s)));
			d[G(I,s)]=0;
			while(!q.empty())
			{
				p=q.top();q.pop();
				for(i=1;i<=n;++i)
					if(t=D[p.second][i],t<=50&&d[p.second]+t<d[i])
						d[i]=d[p.second]+t,q.push(P(p.first-t,i));
			}
			if(d[G(I,g)]==V)puts("NA");
			else
			{
				//S[©çÔÉAÚ±³êÄ¢éÓðgÁÄ¢éàÌð½ÇÁÄ¢­
				//tÉÇÁµÄ¾ÁÄ¢éÌÅAoÍàtÉ
				//©ª©gÉ}ÂÈ°¿á¾ßæÆ
				vector<int>v(1,G(I,g));
				for(i=G(I,g);i-G(I,s);v.push_back(i=j))for(j=1;j<=n;++j)
					if(i-j&&F(d[i],D[i][j]+d[j]))break;
				for(i=v.size()-1;i>=0;--i)printf("%d%c",I[v[i]-1],i?' ':'\n');
			}
		}
	}
	return 0;
}

C++: #include<vector>
#include<cmath>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
	int n,m,s,g,t;
	while(cin>>n,n){
		double adj[n][n]; rep(i,n)rep(j,n)adj[i][j]=60;
		int x[n],y[n];
		rep(i,n)cin>>t>>x[i]>>y[i];
		rep(i,n)rep(j,i)adj[i][j]=adj[j][i]=hypot(x[i]-x[j],y[i]-y[j]);
		
		cin>>m;
		while(m--){
			cin>>s>>g,s--,g--;
			double cost[n]; rep(i,n)cost[i]=99999999; cost[s]=0;
			vector<vector<int> > path(n); path[s].push_back(s);
			
			vector<int> frontier,next; frontier.reserve(n),next.reserve(n);
			frontier.push_back(s);
			for(;cost[g]==99999999&&!frontier.empty();){
				next.clear();
				rep(i,frontier.size()){
					rep(j,n){
						t=frontier[i];
						if(adj[t][j]<=50&&cost[j]>cost[t]+adj[t][j]){
							cost[j]=cost[t]+adj[t][j];
							path[j]=path[t],path[j].push_back(j);
							next.push_back(j);
						}
					}
				}
				frontier=next;
			}
			if(cost[g]==99999999)cout<<"NA"<<endl;
			else{
				rep(i,path[g].size()){
					cout<<path[g][i]+1;
					if(i==path[g].size()-1)cout<<endl;
					else cout<<" ";
				}
			}
		}
	}
	return 0;
}