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<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
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;
}