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<bits/stdc++.h>
#pragma warning(disable:4996)
#ifdef _MSC_VER
#  define __builtin_popcount __builtin_popcountll
#  define __builtin_popcountll __popcnt
#endif
//#define int long long
using namespace std;
using ll = long long;
using ld = long double;
const long double PI = acos(-1.0);
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int MAX_V = 500;

inline void my_io() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout << fixed << setprecision(10);
}
const int INF = 1e8;
struct edge {
	int from, to;long double  cost;
};
vector<double> dijkstra(int s, vector<vector<edge>>&graph,vector<int>&prev_) {//頂点sからほかのすべての頂点の最短距離を入れたvectorを返す
														 //以下pair<int,int>はfirstは最短距離 secondは頂点番号
	int n = graph.size();
	priority_queue < pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>que;
	vector<double>d(n, INF);//頂点sからの最短距離
	d[s] = 0;//スタート地点からスタート地点の距離はゼロ
	que.push(pair<int, int>(0, s));
	while (!que.empty()) {
		pair<int, int>p = que.top();
		que.pop();
		int v = p.second;
		for (int i = 0; i < graph[v].size(); i++) {
			edge const &e = graph[v][i];
			if (d[e.to] > d[v] + e.cost) {
				d[e.to] = d[v] + e.cost;
				que.push(pair<int, int>(d[e.to], e.to));
				prev_[e.to] = v;
			}
		}
	}
	return d;
}
vector<int> get_path(int t,vector<int>&prev_) {
	vector<int>path;
	for (; t !=-1; t = prev_[t]) {
		path.push_back(t);
	}
	reverse(path.begin(), path.end());
	return path;
}
ld distance(ld x0, ld y0, ld x1, ld y1) {
	return sqrt((x0 - x1)*(x0 - x1) + (y0 - y1)*(y0 - y1));
}
signed main(){
	int n;
	while (cin >> n, n) {
		
		vector<tuple<int, int, int>>vs(n);
		map<int, int>mp;
		map<int, int>mp1;
		for (int i = 0; i < n; i++) {
			int p;
			
			cin >> p >> get<1>(vs[i]) >> get<2>(vs[i]);
			mp[i] = p;  
			mp1[p] = i;
			
		}

		vector < vector<edge>>graph(n);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (i != j) {
					ld d = distance(get<1>(vs[i]), get<2>(vs[i]), get<1>(vs[j]), get<2>(vs[j]));
					if (50 >= d) {
						graph[i].push_back({ i,j,d });
						graph[j].push_back({ j,i,d });

					}
				}
			}
		}
		int m;
		cin >> m;
		for (int i = 0; i < m; i++) {
			int s, g;
			cin >> s >> g;
			vector<int>prev_(n, -1);
			vector<double>distes = dijkstra(mp1[s], graph,prev_);
			if (distes[mp1[g]] == INF) {
				cout << "NA" << endl;

			}
			else {
				assert(prev_[mp1[s]] == -1);
				auto ans = get_path(mp1[g],prev_);
				for (int i = 0; i < ans.size(); i++) {
					ans[i] = mp[ans[i]];
				}
				for (int i = 0; i < ans.size(); i++) {
					int integer = ans[i] ;
					cout << integer;
					if (i != ans.size() - 1) {
						cout << " ";
					}
					else {
						cout << endl;
					}

				}
			}
		}
	}
	return 0;

}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

#define MAX 1100
#define INF (1<<29)
#define EPS 1e-9

struct Point{
  int x, y, id;
};

vector<Point> bill;
double dist[MAX][MAX];

int V;

void init(){
  bill.clear();
  for(int i = 0 ; i < MAX ; i++){
    for(int j = 0 ; j < MAX ; j++){
      dist[i][j] = INF;
      if(i == j) dist[i][j] = 0;
    }
  }
}

int prev[MAX];
void dijkstra(int s){
  int d[MAX];
  bool used[MAX];
  for(int i = 0 ; i < MAX ; i++){
    d[i] = INF;
    used[i] = false;
    prev[i] = -1;
  }
  //fill(d, d+MAX, INF);
  //fill(used, used+MAX, false);
  //fill(prev, prev+MAX, -1);
  d[s] = 0;
  
  while(true){
    int v = -1;
    for(int u = 0 ; u < V ; u++){
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }
    if(v == -1) break;
    used[v] = true;
    
    for(int u = 0 ; u < V ; u++){
      if(d[u] > d[v] + dist[v][u]){
	d[u] = d[v] + dist[v][u];
	prev[u] = v;
      }
    }
  }
}

vector<int> get_path(int t){
  vector<int> path;
  for(; t != -1 ; t = prev[t]) path.push_back(t);
  reverse(path.begin(), path.end());
  return path;
}

double getDist(int from, int to){
  double ret = sqrt( 1.0 * ( ((bill[from].x - bill[to].x)*(bill[from].x - bill[to].x)) +
			     ((bill[from].y - bill[to].y)*(bill[from].y - bill[to].y)) ) );
  return ret;
}
  
int main(){
  while(cin >> V, V){
    bill.clear();
    init();
    Point p;
    for(int i = 0 ; i < V ; i++){
      cin >> p.id >> p.x >> p.y;
      p.id--;
      bill.push_back(p);
    }
    
    for(int i = 0 ; i < V ; i++){
      for(int j= 0 ; j < V ; j++){
	if(i == j) continue;
	double dis = getDist(bill[i].id, bill[j].id);
	//if(dis >= 50 + EPS) continue;
	if(dis <= 50.0 + EPS){
	dist[bill[i].id][bill[j].id] = dist[bill[j].id][bill[i].id] = dis;
	}
      }
    }
    int m;    
    cin >> m;
    int s, g;
    while(m--){
      cin >> s >> g;
      s--, g--;
      dijkstra(s);
      vector<int> ans_path;
      ans_path = get_path(g);
      if(ans_path.size() <= 1) cout << "NA" << endl;
      else{
	for(int i = 0 ; i < (int)ans_path.size() ; i++){
	  if(i == (int)ans_path.size()-1) cout << ans_path[i]+1 << endl;
	  else cout << ans_path[i]+1 << ' ';
	}
      }
      ans_path.clear();
    } 
  }
  return 0;
}