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<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)
#define DBL(x) ((x)*(x))

using namespace std;

typedef unsigned int uint;
typedef long long ll;

const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};

int getInt(){
  int ret = 0,c;
  bool minus = false;
  c = getchar();
  while(!isdigit(c)) c = getchar();
  if(c == '-'){
    minus = true;
    c = getchar();
  }
  while(isdigit(c)){
    ret *= 10;
    ret += c - '0';
    c = getchar();
  }
  if(minus) ret *= -1;
  return ret;
}

double load[1000][1000];
bool memo[1000];
int prev[1000];
int b[1000];
int x[1000];
int y[1000];
int mapping[1001];

int main(){
  int n;
  while(n = getInt()){
    REP(i,n){
      b[i] = getInt();
      x[i] = getInt();
      y[i] = getInt();
      mapping[b[i]] = i;
    }

    REP(i,n) REP(j,n){
      double d = sqrt(DBL(x[i]-x[j]) + DBL(y[i]-y[j]));
      load[i][j] = load[j][i] = (d <= 50 + 1e-10 ? d : 0.0);
    }

    int m = getInt();
    while(m --> 0){
      int s = mapping[getInt()];
      int g = mapping[getInt()];
      memset(memo, 0, sizeof(memo));

      typedef pair<double,pair<int,int> > data;
      priority_queue<data,vector<data>,greater<data> > q;
      q.push(mp(0.0, mp(s, -1)));

      while(!q.empty()){
        double cost = q.top().f;
        int pos  = q.top().s.f;
        int ppos = q.top().s.s;

        q.pop();

        if(memo[pos]) continue;
        memo[pos] = true;
        prev[pos] = ppos;

        if(pos == g){
          vector<int> ans;
          while(pos != s){
            ans.push_back(pos);
            pos = prev[pos];
          }
          ans.push_back(s);
          for(int i=ans.size()-1; i>=0; i--)
            printf("%d%c",b[ans[i]],i==0?'\n':' ');
          break;
        }

        REP(i,n)
          if(!memo[i] && load[pos][i] != 0.0)
            q.push(mp(cost + load[pos][i], mp(i, pos)));

        if(q.empty()){
          puts("NA");
          break;
        }
      }
    }

  }
  return 0;
}

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;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int f(int x,int y){return sqrt(x*x+y*y);}
int 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+1,vector<pii>());
        for(auto itr=mp.begin();itr!=mp.end();itr++){
            for(auto comp=mp.begin();comp!=mp.end();comp++){
                if(itr==comp)continue;
                int 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-1].push_back(pii(comp->first-1,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)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;
                //cout<<prev[2]<<prev[1]<<endl;
            }
        }
    }
}