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 <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
#include <ostream>
using namespace std;

template <typename T>
struct Edge { int src, dst; T cost;
    Edge(int dst, T cost) : src(-1), dst(dst), cost(cost) { }
    Edge(int src, int dst, T cost) : src(src), dst(dst), cost(cost) { }
};
template <typename T> using Edges = vector<Edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
template <typename T> using Matrix = vector<vector<T>>;

template <typename T>
pair<vector<T>, vector<int>> dijkstra(const WeightedGraph<T> &g, int s) {
    const T INF = numeric_limits<T>::max();
    vector<T> dist(g.size(), INF);
    vector<int> prev(g.size(), -1);
    using Pi = pair<T, int>;
    priority_queue<Pi, vector<Pi>, greater<Pi>> que;
    dist[s] = 0; que.emplace(dist[s], s);
    while (!que.empty()) {
        T cost; int u; tie(cost, u) = que.top(); que.pop();
        if (dist[u] < cost) continue;
        for (auto &e: g[u]) {
            int v = e.dst; T nc = e.cost;
            if (dist[v] <= dist[u] + nc) continue;
            dist[v] = dist[u] + nc; prev[v] = u;
            que.emplace(dist[v], v);
        }
    }
    return {dist, prev};
}
template <typename T>
vector<int> build_path(vector<T> &dist, vector<int> &prev, int t) {
    const T INF = numeric_limits<T>::max();
    if (dist[t] == INF) return {};
    vector<int> path;
    for (int u = t; u >= 0; u = prev[u]) path.emplace_back(u);
    reverse(path.begin(), path.end());
    return path;
}


#include <cmath>
template<class T> T dist2(T x, T y) { return x * x + y * y; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
int main() {
    int n;
    while (cin >> n, n) {
        WeightedGraph<double> g(n + 1);
        vector<int> b(n), x(n), y(n);
        for (int i = 0; i < n; i++) cin >> b[i] >> x[i] >> y[i];
        for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
            int d2 = dist2(x[i] - x[j], y[i] - y[j]);
            if (d2 <= 50 * 50) {
                g[b[i]].emplace_back(b[j], sqrt(d2));
                g[b[j]].emplace_back(b[i], sqrt(d2));
            }
        }
        int m; cin >> m;
        while (m--) {
            int ss, gg; cin >> ss >> gg;
            vector<double> dist;
            vector<int> prev;
            tie(dist, prev) = dijkstra(g, ss);
            auto res = build_path(dist, prev, gg);
            if (res.empty()) {
                cout << "NA" << endl;
            } else {
                for (int i = 0; i < res.size(); i++) cout << res[i] << " \n"[i == res.size() - 1];
            }
        }
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs
#include <cstdio>	// require printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>	// require tolower, toupper
#include <fstream>	// require freopen
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define DEBUG 0

using namespace std;

typedef long long ll;
typedef pair<double, int> P;
//typedef pair<double, int> pdi;

const int INF = 1000000000;

double adj[1005][1005];
int path[1005];
double d[1005];
int n;
bool visit[1005];

// ノード:s からの最短距離を求める
bool dijkstra (int s, int t )
{
	memset (path, -1, sizeof (d ) );
	memset (visit, false, sizeof (visit ) );
	// greater<P> を指定することでfirstが小さい順に取り出せるようにする
//	priority_queue<P, vector<P>, greater<P> > que;
	priority_queue<P> que;

	fill (d,  d + n, INF );
	d[s] = 0.0;
	que.push (P (0.0, s ) );
		
	while (!que.empty() ){
		P p = que.top(); que.pop();
		int u = p.second;
		if (u == t ) return true;
		visit[u] = true;
		if (d[u] < p.first ) continue;
		rep (v, n ){
			if (visit[v] ) continue;
			if (d[v] > d[u] + adj[u][v] ){
				d[v] = d[u] + adj[u][v];
				que.push (P (-d[v], v ) );
				path[v] = u;
			} // end if
		} // end rep
	} // end while

// for debug
#if DEBUG
	cout << "path: " << endl;
	rep (i, n ){
		cout << setw(2) << path[i];
	} // end rep
	cout << endl;
	cout << "dis: " << endl;
	rep (i, n ){
		cout << d[i] << ' ';
	} // end rep
	cout << endl;
#endif
	return false; 
}

void disp_path (int s, int t )
{
	vector<int> res;
	res.push_back (t );
	int curr = t;
	while (path[curr] != -1 ){
		curr = path[curr];
		res.push_back (curr );
	} // end while

	reverse (ALL (res ) );
	rep (i, res.size() ){
		cout << res[i] + 1 << (i != res.size() - 1 ? ' ' : '\n' );
	} // end rep
}

int main()
{
//	cut here before submit 
//	freopen ("testcase.spiderjin", "r", stdin );

	while (scanf ("%d", &n ) && n != 0 ){
//		memset (adj, -1, sizeof (adj ) );
		rep (i, n ) rep (j, n ) adj[i][j] = INF;
		vector<P> p;
		p.clear();
		rep (i, n ){
			int id, x, y;
			scanf ("%d %d %d", &id, &x, &y );
			p.push_back (P (x, y ) );
		} // end rep

		rep (i, n ){
			rep (j, n ){
				if (i == j ) continue;
				int xx = p[i].first - p[j].first;
				int yy = p[i].second - p[j].second;
				int dis = xx*xx + yy*yy;
				if (dis <= 50*50 ){
					adj[i][j] = sqrt (dis );
					adj[j][i] = sqrt (dis );
				} // end if
			} // end rep
		} // end rep

		int m;
		scanf ("%d", &m );
		rep (i, m ){
			int s, t;
			scanf ("%d %d", &s, &t );
			s--, t--;
			if (dijkstra (s, t ) ){
				disp_path (s, t );
			}else{
				printf ("NA\n" );
			} // end if
		} // end rep
	} // end while
	
	return 0;
}