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<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>

using namespace std;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
#define INF 10000000
#define rep(i,j) for(int i=0;i<(j);++i)
#define reps(i,j,k) for(int i=j;i<k;++i)
typedef long long ll;
typedef unsigned long long ull;

double cost[1000][1000];
int d[1000];
bool used[1000];
int prev[1000];
int V;

void dijkstra(int s){
	fill(d,d+V,INF);
	fill(used,used+V,false);
	fill(prev,prev+V,-1);
	d[s] = 0;
	while(true){
		int v = -1;
		rep(i,V)if(!used[i] && (v == -1 || d[i] < d[v]))v = i;
		if(v == -1)break;
		used[v] = true;
		rep(i,V){
			if(d[i] > d[v] + cost[v][i]){
				d[i] = d[v] + cost[v][i];
				prev[i] = v;
			}
		}
	}
	return ;
}

vector<int> get_path(int t){
	vector<int> path;
	for(; t != -1; t = prev[t])path.push_back(t);
	reverse(path.begin(),path.end());
	return path;
}

int main(){
	int n;
	while(scanf("%d",&n),n){
		rep(i,1000)rep(j,1000)cost[i][j] = INF;
		int num[12800]={0},x[12800]={0},y[12800]={0};
		rep(i,n){
			scanf("%d%d%d",&num[i],&x[i],&y[i]);
			num[i]--;
		}
		rep(i,n){
			reps(j,i+1,n){
				double dis = sqrt(((x[i]-x[j])*(x[i]-x[j]))+((y[i]-y[j])*(y[i]-y[j])));
				cost[i][j] = (dis > 50) ? INF : dis;
				cost[j][i] = (dis > 50) ? INF : dis;
			}
		}
		V = n;
		int m;
		scanf("%d",&m);
		rep(i,m){
			vector<int> ans;
			int from,to;
			scanf("%d%d",&from,&to);
			from--;to--;
			dijkstra(from);
			ans = get_path(to);
			int len = ans.size();
			if(ans[0] == to)puts("NA");
			else{
				rep(i,len-1)printf("%d ",ans[i]+1);
				printf("%d\n",ans[len-1]+1);
			}			
		}
	}
	return 0;
}

C++: #include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;

#define INF 10e6
#define X real()
#define Y imag()
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
typedef complex<double> P;


int n; //ビルの数
P build[1001]; //ビルの座標
double graph[1001][1001];//距離グラフ
double d[1001];  //最短距離
int prev[1001];  //経路
bool used[1001]; //	訪問済み

void initial(){
	for(int i=0;i<1001;i++)
		for(int j=0;j<1001;j++)
			graph[i][j]=(abs(build[i]-build[j]))<=50.0?abs(build[i]-build[j]):INF;
	return ;
}

void dijkstra(int s){
	fill(d,d+1001,INF);
	fill(used,used+1001,false);
	fill(prev,prev+1001,-1);
	d[s]=0;
	
	while(true){
		int v=-1;
		for(int u=0;u<n;u++){
			if(!used[u]&&(v==-1||d[u]<d[v]))v=u;
		}
		if(v==-1)
			break;
		used[v]=true;
		for(int u=0;u<n;u++){
			if(d[u]>d[v]+graph[u][v])
				d[u]=d[v]+graph[u][v],prev[u]=v;
		}
	}
	return ;
}

vector<int> get_path(int t){
	vector<int> path;
	for(;t!=-1;t=prev[t])path.push_back(t);
	reverse(path.begin(),path.end());
	return path;

}

int main(){
	int tem,m;
	while(cin >> n,n){
		for(int i=0;i<n;i++)
			cin >>tem,cin >>build[tem-1].X>> build[tem-1].Y;
		initial();
		cin >> m;
		for(int i=0;i<m;i++){
			int s,g,c;
			vector<int> root;
			cin >> s >> g;
			dijkstra(s-1);
			if(d[g-1]>=INF)
				cout << "NA" << endl;
			else{
				root=get_path(g-1);
				c=0;
				EACH(j,root)
					cout<< (c? " ":"") << (*j)+1,c++;
				cout << endl;
			}
		}
	}

return 0;
}