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 <queue>
#include <stack>
#include <utility>
#include <cmath>
#include <cfloat>
using namespace std;

typedef pair<double, int> di;

struct Node {
    int x, y;
    int from;
    double c;
    bool d;
    vector<di> tos;
};

int n;
vector<Node> ns;

bool dijkstra(int s, int t) {
    for (int i = 1; i <= n; i++) {
        ns[i].from = -1;
        ns[i].c = DBL_MAX;
        ns[i].d = false;
    }
    ns[s].c = 0.0;
    priority_queue<di, vector<di>, greater<di> > q;
    q.push(make_pair(0, s));
    while (!q.empty()) {
        di p = q.top();
        q.pop();
        int i = p.second;
        if (ns[i].d) {
            continue;
        }
        ns[i].d = true;
        if (i == t) {
            return true;
        }
        for (vector<di>::iterator it = ns[i].tos.begin(); it != ns[i].tos.end(); it++) {
            double cost = ns[i].c + it->first;
            int to = it->second;
            if (!ns[to].d && cost < ns[to].c) {
                ns[to].from = i;
                ns[to].c = cost;
                q.push(make_pair(cost, to));
            }
        }
    }
    return false;
}

int dist2(int x1, int y1, int x2, int y2) {
    return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
}

int main() {
    while (cin >> n, n) {
        ns.clear();
        ns.resize(n+1);
        for (int i = 1; i <= n; i++) {
            int b;
            cin >> b;
            cin >> ns[b].x >> ns[b].y;
        }
        for (int i = 1; i <= n - 1; i++) {
            for (int j = i + 1; j <= n; j++) {
                int d2 = dist2(ns[i].x, ns[i].y, ns[j].x, ns[j].y);
                if (d2 <= 2500) {
                    double d = sqrt(d2);
                    ns[i].tos.push_back(make_pair(d, j));
                    ns[j].tos.push_back(make_pair(d, i));
                }
            }
        }
        int m;
        cin >> m;
        for (int i = 0; i < m; i++) {
            int s, t;
            cin >> s >> t;
            if (dijkstra(s, t)) {
                stack<int> ans;
                while (t != s) {
                    ans.push(t);
                    t = ns[t].from;
                }
                cout << s;
                while (!ans.empty()) {
                    cout << " " << ans.top();
                    ans.pop();
                }
                cout << endl;
            } else {
                cout << "NA" << 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(dij.d[b]>1000000)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");
			}
		}
	}
}