Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)
const INF = 1<<31

func main() {
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	arr := make([][]int, n)
	for i := range arr {
		arr[i] = make([]int, n)
	}
	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			arr[i][j] = INF
		}
	}
	for i := 0; i < n; i++ {
		scanner.Scan()
		buf := strings.Split(scanner.Text(), " ")
		input := make([]int, len(buf))
		for j := range input {
			input[j], _ = strconv.Atoi(buf[j])
		}
		x, k := input[0]-1, input[1]
		for j := 0; j < k; j++ {
			y := input[j+2]-1
			arr[x][y] = 1
		}
	}
	for k := 0; k < n; k++ {
		arr[k][k] = 0
		for i := 0; i < n; i++ {
			if arr[i][k] >= INF {
				continue
			}
			for j := 0; j < n; j++ {
				if arr[k][j] >= INF {
					continue
				}
				arr[i][j] = min(arr[i][j], arr[i][k]+arr[k][j])
			}
		}
	}
	scanner.Scan()
	p, _ := strconv.Atoi(scanner.Text())
	for i := 0; i < p; i++ {
		scanner.Scan()
		buf := strings.Split(scanner.Text(), " ")
		input := make([]int, len(buf))
		for j := range input {
			input[j], _ = strconv.Atoi(buf[j])
		}
		s, d, v := input[0]-1, input[1]-1, input[2]
		if arr[s][d] < v {
			fmt.Println(arr[s][d]+1)
		} else {
			fmt.Println("NA")
		}
	}
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

C++: #include <cstdio>
#include <iostream>
#include <queue>
using namespace std;

int main(){
	int n, p;
	bool route[101][101];
	
	for(int i=0; i<=100; ++i)
	for(int j=0; j<=100; ++j)
	route[i][j]=false;
	
	scanf(" %d", &n);
	for(int i=0; i<n; ++i){
		int r, k;
		scanf(" %d %d", &r, &k);
		for(int j=0; j<k; ++j){
			int t;
			scanf(" %d", &t);
			route[r][t]=true;
		}
	}
	
	scanf(" %d", &p);
	for(int i=0; i<p; ++i){
		int cost[101];
		for(int j=0; j<=100; ++j) cost[j]=20000;
		
		int s, d, v;
		scanf(" %d %d %d", &s, &d, &v);
		
		//bfs
		queue<int> que;
		cost[s]=1;
		que.push(s);
		while( !que.empty() ){
			int v=que.front();
			que.pop();
			for(int j=1; j<=n; ++j){
				if(route[v][j] && cost[j] > cost[v]+1){
					cost[j]=cost[v]+1;
					que.push(j);	
				}
			}	
		}
		
		if(cost[d] <= v) printf("%d\n", cost[d]);
		else printf("NA\n");
	}	
	
	
}

C++: #include <iostream>
#include <vector>
using namespace std;

struct Node {
    vector<int> to;
    bool isDone;
    int cost;
};

const int MAX_N = 100;
Node nodes[MAX_N + 1];
int n;

int dijkstra(int start, int end) {
    for (int i = 1; i <= n; i++) {
        nodes[i].isDone = false;
        nodes[i].cost = -1;
    }
    nodes[start].cost = 0;
    while (true) {
        int min_idx = -1;
        for (int i = 1; i <= n; i++) {
            if (nodes[i].isDone == true || nodes[i].cost < 0) {
                continue;
            }
            if (min_idx < 0 || nodes[i].cost < nodes[min_idx].cost) {
                min_idx = i;
            }
        }
        if (min_idx < 0) {
            break;
        }
        nodes[min_idx].isDone = true;
        int cost = nodes[min_idx].cost + 1;
        for (vector<int>::iterator it = nodes[min_idx].to.begin(); it != nodes[min_idx].to.end(); it++) {
            if (nodes[*it].cost < 0 || cost < nodes[*it].cost) {
                nodes[*it].cost = cost;
            }
        }
    }
    return nodes[end].cost;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int r, k;
        cin >> r >> k;
        for (int j = 0; j < k; j++) {
            int t;
            cin >> t;
            nodes[r].to.push_back(t);
        }
    }
    int p;
    cin >> p;
    for (int i = 0; i < p; i++) {
        int s, d, v;
        cin >> s >> d >> v;
        int cost = 1 + dijkstra(s, d);
        if (cost > v) {
            cout << "NA" << endl;
        } else {
            cout << cost << endl;
        }
    }
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <queue>

using namespace std;

struct Packet{
	Packet(){}

	Packet(int arg_ttl,int loc){
		ttl = arg_ttl;
		for(int i=0; i < 101; i++)checkTable[i] = 0;
		checkTable[loc] = 1;
		current = loc;
	}

	void set(int loc){
		checkTable[loc] = 1;
		current = loc;
	}

	int ttl,checkTable[101],current;
};

int main(){

	int n,r,k,to,table[101][101],num_of_packet,start,goal,t_limit,memo[101][101];
	Packet tmp;

	for(int i=1; i <= n; i++){
		for(int k=1; k <= n; k++){
			table[i][k] = 0;
			memo[i][k] = 0;
		}
	}

	scanf("%d",&n);

	for(int i = 0; i < n; i++){
		scanf("%d %d",&r,&k);
		for(int p=0;p < k; p++){
			scanf("%d",&to);
			table[r][to] = 1;
		}
	}

	scanf("%d",&num_of_packet);

	queue<Packet> Q;
	bool FLG;

	for(int i=0; i < num_of_packet; i++){
		scanf("%d %d %d",&start,&goal,&t_limit);

		FLG = false;

		if(memo[start][goal] != 0){
			if(memo[start][goal] <= t_limit){
				printf("%d\n",memo[start][goal]);
			}else{
				printf("NA\n");
			}
			continue;
		}

		for(int i = 1; i <= n; i++){
			if(i != start && table[start][i] == 1){
				if(memo[i][goal] > 0 && memo[i][goal] < t_limit){
					printf("%d\n",memo[i][goal]+1);
					memo[start][goal] = memo[i][goal]+1;
					FLG = true;
					break;
				}
				Packet p(t_limit-1,start);
				p.set(i);
				Q.push(p);
			}
		}



		while(!Q.empty() && FLG == false){
			tmp = Q.front();
			Q.pop();

			if(tmp.current == goal){
				printf("%d\n",t_limit - tmp.ttl+1);
				FLG = true;

				while(!Q.empty())Q.pop();

				memo[start][goal] = t_limit - tmp.ttl+1;

				break;
			}

			if(tmp.ttl > 1){
				for(int i=1; i <= n; i++){
					if(i != tmp.current && tmp.checkTable[i] == 0 && table[tmp.current][i] == 1){
						if(memo[i][goal] > 0 && memo[i][goal] < tmp.ttl){
							printf("%d\n",t_limit-tmp.ttl+memo[i][goal]+2);
							memo[start][goal] = t_limit-tmp.ttl+memo[i][goal]+2;
							FLG = true;
							while(!Q.empty())Q.pop();
							break;
						}

						Packet p = tmp;
						p.ttl--;
						p.set(i);
						Q.push(p);
					}
				}
			}
		}

		if(!FLG){
			printf("NA\n");
		}

	}

    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

const int INF = 1000000;
int edge[100][100];

void WF(int n){
	for(int k = 0;k < n;++k){
		for(int i = 0;i < n;++i){
			for(int j = 0;j < n;++j){
				if(i == j) continue;
				edge[i][j] = min(edge[i][j], edge[i][k] + edge[k][j]);
			}
		}
	}
}

int main(){
	int n, p, r, k, t, a;
	for(int i = 0;i < 100;++i){
		for(int j = 0;j < 100;++j){
			edge[i][j] = INF;
		}
	}
	cin >> n;
	for(int i = 0;i < n;++i){
		cin >> r >> k;
		--r;
		for(int j = 0;j < k;++j){
			cin >> a;
			--a;
			edge[r][a] = 1;
		}
	}
	WF(n);
	cin >> p;
	for(int i = 0;i < p;++i){
		int s, d, v;
		cin >> s >> d >> v;
		--s;
		--d;
		if(edge[s][d] + 1 <= v) cout << edge[s][d] + 1 << endl;
		else cout << "NA" << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;n++)
int n,nn, a, b, c;

int main() {
	cin >> n;
	int data[n+1][n+1];
	for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				data[i][j]=900000;
			}
	}
	for (int i = 0; i < n; ++i) {
		cin >> a>>b;
		for (int j = 0; j < b; ++j) {
			cin >> c;
			data[a][c]=1;
		}
	}


	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			for (int k = 1; k <= n; ++k) {
				data[j][k]=min(data[j][k],data[j][i]+data[i][k]);
			}
		}
	}
	/*for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				cout<<i<<" "<<j<<" "<<data[i][j]+1<<endl;
			}
	}*/


	cin>>n;
	for (int i = 0; i < n; ++i) {
		cin>>a>>b>>c;
		if(data[a][b]+1<=c){cout<<data[a][b]+1<<endl;}
		else{cout<<"NA"<<endl;}
	}
return 0;

}