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 <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 TRUE 1
#define FALSE 0

#define INPUT_SUCCESS 0
#define INPUT_ERORR -1

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

I4 CalcDijikstra(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 = CalcDijikstra(i4StartRouter,i4GoalRouter,i4TTL,1);
		if(i4Ans > 0){
			printf("%d\n",i4Ans);
		}
		else
		{
			printf("NA\n");
		}
		printf("--------------\n");
	}
	else
	{
		i1Return = INPUT_ERORR;
	}
	return i1Return;
}

I4 CalcDijikstra(I4 i4Sender,I4 i4Destination,I4 i4TTL,I4 i4RouterSum)
{
	I1 i1StarTable[MAX_ROUTER+1][MAX_ROUTER+1];
	I4 i4MinVal[MAX_ROUTER+1];
	I4 i4RoopCnt1;
	I4 i4RoopCnt2;
	I4 i4RoopCnt3;
	
	for( i4RoopCnt1=1; i4RoopCnt1<=MAX_ROUTER; i4RoopCnt1++)
	{
		i4MinVal[i4RoopCnt1] = 0;
		for(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)
		{
			i1StarTable[i4RoopCnt1][i4RoopCnt2] = FALSE;
		}
	}
	
	i1StarTable[1][i4Sender] = TRUE;
	
	for(i4RoopCnt1=1; i4RoopCnt1<MAX_ROUTER; i4RoopCnt1++)
	{
		if(i4TTL <= i4RoopCnt1)
		{
			printf("TTL over\n");
			return 0;
		}
		for(i4RoopCnt2=1; i4RoopCnt2<=MAX_ROUTER; i4RoopCnt2++)
		{
			if(i1StarTable[i4RoopCnt1][i4RoopCnt2] == TRUE)
			{
				for(i4RoopCnt3=1; i4RoopCnt3<=MAX_ROUTER; i4RoopCnt3++)
				{
					if(u1Connect[i4RoopCnt2][i4RoopCnt3] == CONNECT)
					{
						if(i4RoopCnt3 == i4Destination)
						{
							return i4RoopCnt1+1;
						}
						i1StarTable[i4RoopCnt1+1][i4RoopCnt3] = TRUE;
						printf("%d -> %d\n",i4RoopCnt2,i4RoopCnt3);
					}
					
				}
			}
		}
	}
	printf("search finish\n");
	return 0;
}

C++: #include<vector>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef vector<int> vi;
int main(){
  int n,m; cin>>n;

  int adj[100][100]={0};
  rep(i,n){
    int r,k,t; cin>>r>>k, r--;
    rep(j,k)cin>>t,adj[r][t-1]=1;
  }
  cin>>m;
  vi frontier,next; frontier.reserve(100),next.reserve(100);
  int cost[100];
  rep(i,m){
    int s,d,v; cin>>s>>d>>v,s--,d--;
    frontier.clear(); frontier.push_back(s);
    rep(j,n)cost[j]=9999; cost[s]=0;
    for(int step=0;step<v-1&&cost[d]==9999;step++){
      next.clear();
      rep(j,frontier.size())rep(h,n)if(adj[frontier[j]][h]&&cost[h]>step+1)
	cost[h]=step+1,next.push_back(h);
      frontier=next;
    }
    if(cost[d]!=9999)cout<<cost[d]+1<<endl;
    else cout<<"NA"<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;

int main() {
 int use[100],d[100][100],rn,pn,i,j,to,fr,s1,d1,v1,a,b,c,n;
 for (i=0;i<100;i++) for (j=0;j<100;j++) { d[i][j]=999999999; use[i]=0;}
 cin >> n;
 for (i=0;i<n;i++) {
   cin >> to >> rn; 
   for (j=0;j<rn;j++) { cin >> fr; d[to-1][fr-1]=1; use[to-1]=1; use[fr-1]=1;}
 }
 for (a=0;a<100;a++) for (b=0;b<100;b++) for (c=0;c<100;c++) 
     if (use[a]==1 && use[b]==1 && use[c]==1) d[b][c]=min(d[b][c],d[b][a]+d[a][c]); 
 cin >> pn;
 for (i=0;i<pn;i++) {
   cin >> s1 >> d1 >> v1;
   if (d[s1-1][d1-1]>v1-1) cout << "NA"; else cout << d[s1-1][d1-1]+1;
   cout << endl;
 }
return 0;
 }

C++: #include<iostream>
#include<algorithm>
using namespace std;
int dis[101][101];
main()
{
	int n;
	cin>>n;
	for(int i=0;i<=n;i++)for(int j=0;j<=n;j++)if(i!=j)dis[i][j]=1e9;
	for(int i=0;i<n;i++)
	{
		int r,k;cin>>r>>k;
		for(;k--;)
		{
			int t;cin>>t;
			dis[r][t]=1;
		}
	}
	for(int k=0;k++<n;)for(int i=0;i++<n;)for(int j=0;j++<n;)
		dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	int p;cin>>p;
	for(;p--;)
	{
		int s,t,d;cin>>s>>t>>d;
		if(dis[s][t]<d)cout<<dis[s][t]+1<<endl;
		else cout<<"NA"<<endl;
	}
}