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>
using namespace std;
int main(){
	int n;
	while(cin >> n , n){
		double g[n][n];
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				g[i][j] = 100000000;
		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 < n; j++){
				int xx = x[i] - x[j],
					   yy = y[i] - y[j];
				if(sqrt(pow(xx , 2) + pow(yy , 2)) <= 50 && i != j)
					g[i][j] = g[j][i] = sqrt(pow(xx , 2) + pow(yy , 2));
			}
		int m;
		cin >> m;
		int s , go;
		for(int i = 0; i < m; i++){
			cin >> s >> go;
			s--; go--;
			vector <int> used(n,false);
			vector <int> gone(n,false);
			vector <double> dist(n,100000000);
			dist[s] = 0;
			gone[s] = 0;
			while(1){
				int va = -1;
				for(int j = 0; j < n; j++)
					if(used[j] == false && (va == -1 || dist[va] > dist[j]))
						va = j;
				if(va == -1)
					break;
				used[va] = true;
				for(int j = 0; j < n; j++){
					if(dist[j] >= dist[va] + g[va][j])
						gone[j] = va;
					dist[j] = min(dist[j] , dist[va] + g[va][j]);
				}
			}
			if(s == go)
				cout << s + 1 << " " << go + 1 << endl;
			else if(dist[go] == 100000000)
				cout << "NA" << endl;
			else{
				int kari = go;
				stack <int> out;
				while(1){
					out.push(gone[kari] + 1);
					kari = gone[kari];
					if(kari == s)
						break;
				}
				while(!out.empty()){
					cout << out.top() << " ";
					out.pop();
				}
				cout << go + 1 << endl;
			}
		}
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)
#define int long long

const int inf = 1 << 25;
const ll INF = 1LL << 55;

struct edge
{
  int to, cost;
  edge(){}
  edge(int to, int cost):to(to), cost(cost){}
};

int n;
vector<Pl> pos;
vector< vector<edge> > graph;
vector<int> b;

void dijkstra(int s, int g)
{
  vector<int> min_cost(n, INF);
  vector<int> prevv(n, -1);
  priority_queue<Pl, vector<Pl>, greater<Pl> > que;
  que.push(Pl(0, s));
  min_cost[s] = 0;
  while(!que.empty()) {
    Pl p = que.top(); que.pop();
    if(p.S == g) break;
    if(min_cost[p.S] < p.F) continue;
    for(edge e : graph[p.S]) {
      if(e.cost + p.F < min_cost[e.to]) {
	min_cost[e.to] = e.cost + p.F;
	//cout << " " << p.S << " " << e.to << " " << e.cost << endl;
	prevv[e.to] = p.S;
	que.push(Pl(min_cost[e.to], e.to));
      }
    }
  }
  if(min_cost[g] == INF) {
    puts("NA");
    return;
  }
  vector<int> ans;
  for(int v = g; v != -1; v = prevv[v]) {
    ans.push_back(v+1);
  }
  reverse(all(ans));
  for(int i = 0; i < ans.size(); i++) {
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
}

int dist(Pl a, Pl b)
{
  return ((a.F-b.F)*(a.F-b.F) + (a.S-b.S)*(a.S-b.S));
}

signed main()
{
  while(cin >> n, n) {
    pos.clear(); pos.resize(n);
    graph.clear(); graph.resize(n);
    b.clear(); b.resize(n);
    for(int i = 0; i < n; i++) {
      cin >> b[i]; cin >> pos[b[i]-1].F >> pos[b[i]-1].S;
    }
    for(int i = 0; i < n; i++) {
      for(int j = i+1; j < n; j++) {
	if(dist(pos[i], pos[j]) <= 50LL*50LL) {
	  //cout << i+1 << " " << j+1 << " "<< dist(pos[i], pos[j]) << endl;
	  graph[i].push_back(edge(j, dist(pos[i], pos[j])));
	  graph[j].push_back(edge(i, dist(pos[i], pos[j])));	  
	}
      }
    }
    int m; cin >> m;
    while(m--) {
      int s, g; cin >> s >> g;
      s--, g--;
      dijkstra(s, g);
    }
  }
  return 0;
}