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++: #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }



int main()
{
  while(true){
    ll N; cin>>N; if(N==0) break;
    vector<vector<pair<ll,double>>> graph(N,vector<pair<ll,double>>(0));
    
    //grid作成
    vector<pair<ll,ll>> grid(N);
    rep(i,N){
      ll b; cin>>b; b--;
      ll x,y; cin>>x>>y;
      grid.at(b)={x,y};
    }
    
    //重み付きグラフつくる
    rep(i,N){
      for(int j=i+1;j<N;j++){
        ll xi,yi,xj,yj;
        tie(xi,yi)=grid.at(i);
        tie(xj,yj)=grid.at(j);
        if((xi-xj)*(xi-xj)+(yi-yj)*(yi-yj)<=2500){
          graph.at(i).push_back({j,sqrt((xi-xj)*(xi-xj)+(yi-yj)*(yi-yj))});
          graph.at(j).push_back({i,sqrt((xi-xj)*(xi-xj)+(yi-yj)*(yi-yj))});
        }
      }
    }
    
    //bfs
    ll M; cin>>M;
    vector<double> table;
    vector<ll> memo;
    rep(i,M){
      table=vector<double>(N,INF);
      memo=vector<ll>(N);
      ll s,g; cin>>s>>g; s--; g--;
      queue<ll> que;
      que.push(s);
      table.at(s)=0;
      while(!que.empty()){
        auto node=que.front();;
        que.pop();
        for(auto hoge:graph.at(node)){
          ll p; double cost;
          tie(p,cost)=hoge;
          if(chmin(table.at(p),table.at(node)+cost)){
            memo.at(p)=node;
            que.push(p);
          }
        }
      }
      if(table.at(g)==INF) {cout<<"NA"<<endl; continue;}
      vector<ll> vec(1,g);
      while(true){
        if(vec.at(vec.size()-1)==s) break;
        ll n=vec.at(vec.size()-1);
        vec.push_back(memo.at(n));
      }
      reverse(vec.begin(),vec.end());
      ll sz=vec.size();
      rep(i,sz){
        if(i!=0) cout<<" ";
        cout<<vec.at(i)+1;
      }
      cout<<endl;
    }
  }

  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>

const int INF = 1000000;
using namespace std;

void sub(vector<vector<double> >edge,int s,int g){
    vector<double> kyori(edge.size());
    for(int i=0;i<kyori.size();i++)kyori[i]=INF;
    kyori[s] = 0;
    priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
    q.push(make_pair(s,0));
    while(!q.empty()){
        pair<int,int> p = q.top();q.pop();

        if(kyori[p.first] < p.second) continue;
        for(int i=0;i<edge.size();i++){
            if(kyori[i] > kyori[p.first]+edge[p.first][i]){
                kyori[i] = kyori[p.first]+edge[p.first][i];
                q.push(make_pair(i,kyori[i]));
            }
        }
    }
    if(kyori[g] == INF){
        cout << "NA" << endl;
        return ;
    }else{
        int u = g;
        vector<int> prev;
        prev.push_back(u);
        while(u!=s){
            for(int i=0;i<edge.size();i++){
                if(i==u)continue;
                if(abs(kyori[u]-(kyori[i]+edge[i][u])) < 1){
                    u = i;
                    prev.push_back(u);
                    break;
                }
            }
        }
        for(int i=prev.size()-1;i>-1;i--){
            if(i!=prev.size()-1) cout << " ";
            cout << prev[i];
        }
        cout << endl;

    }
}
void solve(int n){
    vector<pair<int,int> > v(1001);
    vector<vector<double> > edge(v.size(),vector<double>(v.size()));
    for(int i=0;i<v.size();i++){
        v[i] = make_pair(INF,INF);
    }
    for(int i=0;i<n;i++){
        int b,x,y;
        cin >> b >> x >> y;
        v[b] = make_pair(x,y);
    }
    for(int i=0;i<v.size();i++){
        for(int j=0;j<v.size();j++){
            if((v[i].first == INF && v[i].second==INF) ||
               (v[j].first == INF && v[j].second==INF)){
                edge[i][j] = INF;
            }else{
                double len = sqrt((v[i].first-v[j].first)*(v[i].first-v[j].first)+
                                  (v[i].second-v[j].second)*(v[i].second-v[j].second));
                if(len > 50){
                    edge[i][j] = INF;
                }else{
                    edge[i][j] = len;
                }
            }
        }
    }
    int m;
    cin >> m;
    for(int i=0;i<m;i++){
        int s,g;
        cin >> s >> g;
        sub(edge,s,g);
    }
}
int main(){
    while(true){
        int n;
        cin >> n;
        if(n==0)break;
        solve(n);
    }
    return 0;
}