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++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<double> vd;
typedef std::vector<std::string> vs;
typedef std::vector<pii> vpii;
typedef std::vector<vi> vvi;
typedef std::vector<vpii> vvpii;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
const double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { rep(i,v.size()) is >> v[i]; return is; }
template<typename A, typename B> std::istream &operator>>(std::istream &is, std::pair<A, B> &p) { is >> p.first; is >> p.second; return is; }
using namespace std;
// clang-format on

template<typename InputIterator> std::string join(InputIterator first, InputIterator last, const std::string &sep) {
  if (first == last) return "";
  std::stringstream ss;
  ss << *(first++);
  for_each(first, last, [&](typename InputIterator::value_type &x) { ss << sep << x; });
  return ss.str();
}

typedef double Weight;
struct Edge {
  int src, dst;
  Weight weight;
  Edge(const int &s = 0, const int &d = 0, const Weight &w = 0) : src(s), dst(d), weight(w) {}
};

typedef std::vector<Edge> Edges;
typedef std::vector<Weight> Array;
typedef std::vector<Array> Matrix;

class Graph {
  std::vector<Edges> g;

public:
  Graph(const int &size = 0) : g(size) {}
  int size() const { return g.size(); }
  const Edges &operator[](const int &i) const { return g[i]; }
  void addArc(const int &src, const int &dst, const Weight &w = 1) { g[src].emplace_back(src, dst, w); }
  void addEdge(const int &node1, const int &node2, const Weight &w = 1) {
    addArc(node1, node2, w);
    addArc(node2, node1, w);
  }
};

template<int inf = std::numeric_limits<Weight>::max() / 8> std::pair<std::vector<Weight>, std::vector<int>> dijkstra(const Graph &g, const int &src) {
  using state = std::pair<Weight, int>;
  std::priority_queue<state, std::vector<state>, std::greater<state>> q;
  std::vector<Weight> dist(g.size(), inf);
  std::vector<int> via(g.size());
  dist[src] = 0;
  q.emplace(0, src);
  while (q.size()) {
    Weight d;
    int v;
    std::tie(d, v) = q.top();
    q.pop();
    if (dist[v] < d) continue;
    for (auto &e : g[v]) {
      if (cmin(dist[e.dst], dist[v] + e.weight)) {
        via[e.dst] = v;
        q.emplace(dist[e.dst], e.dst);
      }
    }
  }
  return {dist, via};
}

struct node {
  double x, y;
  node(double x = 0, double y = 0) : x(x), y(y) {}
};

main {
  int n;
  while (cin >> n, n) {
    Graph t(n);
    vector<node> v(n);
    rep(i, n) {
      int b, x, y;
      cin >> b >> x >> y;
      --b;
      v[b] = {double(x), double(y)};
    }
    rep(i, n) loop(j, i + 1, n) {
      double d = hypot(v[i].x - v[j].x, v[i].y - v[j].y);
      if (d <= 50.0) t.addEdge(i, j, d);
    }
    int m;
    cin >> m;
    while (m--) {
      int s, g;
      cin >> s >> g;
      --s, --g;
      vector<Weight> dist;
      vector<int> via;
      tie(dist, via) = dijkstra<INF>(t, s);
      if (dist[g] == INF) {
        cout << "NA" << endl;
        continue;
      }
      list<int> l;
      for (int i = g;; i = via[i]) {
        l.push_front(i + 1);
        if (i == s) break;
      }
      cout << join(all(l), " ") << endl;
    }
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>

int main(){
    while (true){
    int n;
    cin >> n;
    if (n==0) return 0;
    vector<pp> a(n+1);
    for (int i=1;i<n+1;i++){
        int h;
        cin >> h;
        cin >> a.at(h).first >> a.at(h).second;
    }
    vector<vector<pair<int,double>>> d(n+1,vector<pair<int,double>>(0));
    pair<int,double> v;
    for (int i=1;i<n+1;i++){
        for (int j=1;j<n+1;j++){
            if (i==j) continue;
            if ((a.at(i).first-a.at(j).first)*(a.at(i).first-a.at(j).first)+(a.at(i).second-a.at(j).second)*(a.at(i).second-a.at(j).second)>2500) continue;
            double yyyy=(a.at(i).first-a.at(j).first)*(a.at(i).first-a.at(j).first)+(a.at(i).second-a.at(j).second)*(a.at(i).second-a.at(j).second);
            v.second=sqrt(yyyy);v.first=j;
            d.at(i).push_back(v);
        }
    }
    int t;
    cin >> t;
    queue<int> q;
    
    
    for (int i=0;i<t;i++){
        vector<double> df(n+1);
        vector<vector<int>> r(n+1,vector<int>(0));
        for (int j=1;j<n+1;j++){
            df.at(j)=10000000;
        }
        int aa,bb;
        cin >> aa >> bb;
        q.push(aa);
        df.at(aa)=0;
        while(!q.empty()){
            int ii=q.front();
            q.pop();
            for (int j=0;j<d.at(ii).size();j++){
                int w=d.at(ii).at(j).first;
                double ww=d.at(ii).at(j).second;
                if (df.at(ii)+ww<df.at(w)) {
                    df.at(w)=df.at(ii)+ww;
                    q.push(w);
                    r.at(w)=r.at(ii);
                    r.at(w).push_back(ii);
                }
            }
        }
        if (r.at(bb).size()==0) cout << "NA" << endl;
        else {
            for (int j=0;j<r.at(bb).size();j++){
                cout << r.at(bb).at(j) << " ";
            }
            cout << bb << endl;
        }
    }
    }}