#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

int main() {
	vvi cost(100, vi(100, INF));

	int n;
	cin >> n;
	int r, k, t;
	REP(i, n) {
		cin >> r >> k;
		REP(j, k) {
			cin >> t;
			cost[r-1][t-1] = 1;
		}
	}

	REP(k, 100) {
		REP(i, 100) {
			REP(j, 100) {
				cost[i][j] = min(cost[i][j], cost[i][k]+cost[k][j]);
			}
		}
	}

	cin >> n;
	REP(i, n) {
		cin >> r >> k >> t;
		if(cost[r-1][k-1]+1 <= t) {
			cout << cost[r-1][k-1]+1 << endl;
		} else {
			cout << "NA" << endl;
		}
	}

    return 0;
}