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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

#define INF (1 << 30)
#define MAX_E 10000
#define MAX_V 1000

struct edge{
	int from;
	int to;
	int cost;
};

edge es[MAX_E];
int d[MAX_V];
int V, E;// V???????????°???E????????°

// O(VE)??§????????????????????????????????§??????

void shortest_path(int s){
	for(int i = 1; i <= V; i++){
		d[i] = INF;
	}
	d[s] = 0;
	while(true){
		bool update = false;
		for(int i = 0; i < E; i++){
			edge e = es[i];
			if(d[e.from] != INF && d[e.to] > d[e.from] + e.cost){
				d[e.to] = d[e.from] + e.cost;
				update = true;
			}
		}
		if(!update){
			break;
		}
	}
}

int main(){
	
	int n, p;
	
	cin >> n;
	
	int from_, num, to_, length;
	
	V = n;
	
	E = 0;
	
	for(int i = 0; i < n; i++){
		cin >> from_ >> num;
		for(int j = 0; j < num; j++){
			cin >> to_;
			es[E].from = from_;
			es[E].to = to_;
			es[E].cost = 1;
			E++;
		}
	}
	
	cin >> p;
	
	for(int i = 0; i < p; i++){
		cin >> from_ >> to_ >> length;
		shortest_path(from_);
		if(d[to_] < length){
			printf("%d\n", d[to_] + 1);
		}else{
			printf("NA\n");
		}
	}
	
	return 0;
}

C++: /* ????????????????????????????????????????????? */
#include <stdio.h>

/* ?????°???????????? */
typedef	void			VD;
typedef	signed char		I1;
typedef unsigned char 	U1;
typedef	signed short	I2;
typedef unsigned short 	U2;
typedef	signed int		I4;
typedef unsigned int 	U4;

/* ?????°?????? */
#define MAX_ROUTER 100
#define MAX_TTL 10000

#define CONNECT 1
#define DISCONNECT 0
#define SENTINEL -1

#define INPUT_SUCCESS 0
#define INPUT_ERORR -1

/* ????????????????????£?¨? */
VD setInit(VD);
I1 inputConnectInfo(VD);
I1 inputTransmitPacket(VD);
I4 CalcRouterSum(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum);

/* ??°?????????????????° */
I1 u1Connect[MAX_ROUTER+1][MAX_ROUTER+1];
I4 i4RouterNum;

I4 main(VD)
{
	I1 i1ErrorCheck;
	I4 i4CalcNum;
	I4 i4RoopCnt1;
	I4 i4RoopCnt2;
	
	setInit();
	i1ErrorCheck = inputConnectInfo();
	if(i1ErrorCheck == INPUT_SUCCESS){
		scanf("%d",&i4CalcNum);
		for( i4RoopCnt1=0; i4RoopCnt1<i4CalcNum; i4RoopCnt1++)
		{
			inputTransmitPacket();
		}
	}
	return 0;
}

VD setInit(VD)
{
	I4 i4RoopCnt1;
	I4 i4RoopCnt2;
	
	for( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)
	{
		for(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)
		{
			u1Connect[i4RoopCnt1][i4RoopCnt2] = DISCONNECT;
		}
	}
	return;
}

I1 inputConnectInfo(VD)
{
	I1 i1Return;
	I4 i4RoopCnt1;
	I4 i4RoopCnt2;
	I4 i4RouterCnt;
	I4 i4ConnectNum;
	I4 i4AccessPoint;
	
	i1Return = INPUT_SUCCESS;
	
	scanf("%d",&i4RouterNum);
	if(i4RouterNum <= (I4)MAX_ROUTER)
	{
		for( i4RoopCnt1=1; i4RoopCnt1<=i4RouterNum; i4RoopCnt1++)
		{
			scanf("%d%d",&i4RouterCnt,&i4ConnectNum);
			for( i4RoopCnt2=0; i4RoopCnt2<i4ConnectNum; i4RoopCnt2++)
			{
				scanf("%d",&i4AccessPoint);
				u1Connect[i4RouterCnt][i4AccessPoint] = CONNECT;
			}
			u1Connect[i4RouterCnt][i4RouterNum+1] = SENTINEL;
		}
	}
	else
	{
		i1Return = INPUT_ERORR;
	}
	return i1Return;
}

I1 inputTransmitPacket(VD)
{
	I1 i1Return;
	I4 i4StartRouter;
	I4 i4GoalRouter;
	I4 i4TTL;
	I4 i4Ans;
	
	i1Return = INPUT_SUCCESS;
	
	scanf("%d%d%d",&i4StartRouter,&i4GoalRouter,&i4TTL);
	if(i4TTL <= MAX_TTL)
	{
		//printf("start:%d,goal:%d,TTL:%d\n",i4StartRouter,i4GoalRouter,i4TTL);
		i4Ans = CalcRouterSum(i4StartRouter,i4GoalRouter,i4TTL,1);
		if(i4Ans >= i4TTL+1){
			printf("NA\n");
		}
		else
		{
			printf("%d\n",i4Ans);
		}
		//printf("--------------\n");
	}
	else
	{
		i1Return = INPUT_ERORR;
	}
	return i1Return;
}

I4 CalcRouterSum(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum)
{
	//printf("%d -> %d,TTL=%d\n",i4Sender,i4Destination,i4TTL);
	I4 i4RoopCnt1;
	I4 i4MinRouterNum;
	I4 i4TmpRouterSum;
	I4 i4Return;
	
	
	i4Return = i4TTL+i4RouterSum;
	
	if(i4Sender == i4Destination)
	{
		//printf("RouterSum=%d\n",i4RouterSum);
		return i4RouterSum;
	}
	else
	{
		if(i4TTL <= 0)
		{
			//printf("TTL is 0\n");
			return 0;
		}
		else
		{
			i4RoopCnt1 = 1;
			while(u1Connect[i4Sender][i4RoopCnt1] != SENTINEL){
				if(u1Connect[i4Sender][i4RoopCnt1] == CONNECT)
				{
					i4TmpRouterSum = CalcRouterSum(i4RoopCnt1,i4Destination,i4TTL-1,i4RouterSum+1);
					if((i4TmpRouterSum > 0 ) && (i4TmpRouterSum < i4Return))
					{
						//printf("CalcRouterSum()=%d\n",i4TmpRouterSum);
						i4Return = i4TmpRouterSum;
					}
						
				}
				i4RoopCnt1++;
			}
			return i4Return;
		}
	}
	return i4Return;
}

C++: #include <iostream>
#include <queue>
#include <climits>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int n,r,k,t,p,s,d,v;
	int wf[100][100];
	rep(i,100)rep(j,100)wf[i][j] = 1<<21;

	cin >> n;
	for(int i=0;i<n;i++){
		cin >> r >> k;
		r--;
		for(int j=0;j<k;j++){
			cin >> t;
			t--;
			wf[r][t] = 1;
		}
	}
	rep(k,n)rep(i,n)rep(j,n)wf[i][j]=min(wf[i][j],wf[i][k]+wf[k][j]);
	
	cin >> p;
	for(int i=0;i<p;i++){
		cin >> s >> d >> v;
		s--;d--;
		if(v > wf[s][d] )cout << wf[s][d]+1 << endl;
		else cout << "NA" << endl;
	}
}

C++: // AOJ 0144 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0144)
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#define rep(i,a) for(int i=0;i<(a);++i)
#define clr(a,v) memset((a),(v),sizeof(a))

typedef std::pair<int, int> P;

const int MAX_N = 100;

int n, p;
std::vector<int> G[MAX_N];
bool used[MAX_N];

int bfs( int s, int d, int tl )
{
	clr( used, false );
	std::queue<P> que;
	que.push( P( s, 1 ) );

	while( !que.empty() )
	{
		P p = que.front(); que.pop();
		int v = p.first, dep = p.second;

		if( used[v] || dep > tl )
			continue;
		if( v == d )
			return dep;

		used[v] = true;

		rep( i, G[v].size() )
		{
			int u = G[v][i];

			if( !used[u] )
				que.push( P( u, dep+1 ) );
		}
	}

	return -1;
}

int main()
{
	scanf( "%d", &n );
	rep( i, n )
	{
		int r, k;
		scanf( "%d%d", &r, &k );
		--r;

		rep( j, k )
		{
			int t;
			scanf( "%d", &t );
			G[r].push_back(t-1);
		}
	}

	scanf( "%d", &p );
	rep( i, p )
	{
		int s, d, v;
		scanf( "%d%d%d", &s, &d, &v );

		int c = bfs( s-1, d-1, v );

		if( ~c )
			printf( "%d\n", c );
		else
			puts("NA");
	}

	return 0;
}