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 <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
#define int ll
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
double f(int x,int y){return sqrt(x*x+y*y);}
signed main(){
    int n;
    while(cin>>n,n){
        map<int, pii>mp;
        rep(i,n){
            int hoge; pii foo; cin>>hoge>>foo.first>>foo.second;
            mp[--hoge]=foo;
        }
        vector<vector<pii>>edge(n,vector<pii>());
        for(auto itr=mp.begin();itr!=mp.end();itr++){
            for(auto comp=mp.begin();comp!=mp.end();comp++){
                if(itr==comp)continue;
                double dis=f(abs(itr->second.first-comp->second.first),abs(itr->second.second-comp->second.second));
                if( dis<=50){
                    //cout<<itr->first<<" "<<comp->first<<endl;
                    edge[itr->first].push_back(pii(comp->first,dis));
                }
            }
        }
        int k; cin>>k;
        rep(_,k){
            int s,g; cin>>s>>g;
            --s,--g;
            priority_queue<pii,vector<pii>,greater<pii>>que;
            vector<int>prev(n,INF);
            vector<int>d(n,INF);
            d[s]=0;
            que.push(pii(0,s));
            while(!que.empty()){
                pii now=que.top(); que.pop();
                if(now.second==g)break;
                if(d[now.second]<now.first)continue;
                rep(i,edge[now.second].size()){
                    pii next=edge[now.second][i];
                    if(d[next.first]<d[now.second]+next.second)continue;
                    que.push(pii(d[now.second]+next.second,next.first));
                    d[next.first]=now.first+next.second;
                    prev[next.first]=now.second;
                }
            }
            if(edge[s].size()==0 ||edge[g].size()==0||d[g]==INF)cout<<"NA"<<endl;
            else {
                vi hoge;
                for(int v=g;; v=prev[v]){
                    hoge.push_back(v);
                    if(v==s)break;
                }
                reverse(all(hoge));
                rep(i,hoge.size())if(i)cout<<" "<<hoge[i]+1; else cout<<hoge[i]+1;
                cout<<endl;
            }
        }
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

#define double long double

struct Point {
	int x, y;
	
	Point(int a = 0, int b = 0){
		x = a;
		y = b;
	}
};

struct Edge {
	int to;
	double cost;
	
	Edge(int a, double b){
		to = a;
		cost = b;
	}
};

struct State {
	int pos;
	double sum;
	vector<int> route;
	
	State(int a, double b, vector<int> c){
		pos = a;
		sum = b;
		route = c;
	}
	
	bool operator < (const State &t) const {
		return sum > t.sum;
	}
};

int norm(Point &a, Point &b)
{
	return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}	

int n;
Point b[2000];
double d[2000];
vector<int> v[2000];
vector<Edge> g[2000];

void search(int s)
{
	for (int i = 0; i < n; i++){
		v[i].clear();
		d[i] = 1e10;
	}
	
	priority_queue<State> que;
	que.push(State(s, 0.0, vector<int>(0)));
	for ( ;que.size(); que.pop()){
		State st = que.top();
		if (d[st.pos] < st.sum) continue;
		
		d[st.pos] = st.sum;
		v[st.pos] = st.route;
		v[st.pos].push_back(st.pos);
		
		for (int i = 0; i < g[st.pos].size(); i++){
			Edge &e = g[st.pos][i];
			if (d[e.to] < st.sum + e.cost) continue;
			que.push(State(e.to, st.sum + e.cost, v[st.pos]));
		}
	}
}

int main()
{
	while (scanf("%d", &n), n){
		for (int _ = 0; _ < n; _++){
			int B, x, y;
			scanf("%d %d %d", &B, &x, &y);
			b[--B] = Point(x, y);
		}
		
		for (int i = 0; i < n; i++){
			for (int j = 0; j < n; j++){
				if (i == j) continue;
				
				if (norm(b[i], b[j]) <= 50 * 50){
					g[i].push_back(Edge(j, sqrt(norm(b[i], b[j]))));
				}
			}
		}
		
		int m;
		scanf("%d", &m);
		for (int _ = 0; _ < m; _++){
			int s, g;
			scanf("%d %d", &s, &g);
			search(--s);
			
			if (v[--g].size() == 0){
				puts("NA");
				break;
			}
			
			for (int i = 0; i < v[g].size(); i++){
				if (i) printf(" ");
				printf("%d", v[g][i] + 1);
			}
			puts("");
		}
	}
	
	return 0;
}