adj = [[]for i in range(N+1)] depth = [-1] * (N+1) for n in range(1,N+1): V = list(map(int,input().split())) for v in V[2:]: adj[n].append(v) q = queue.Queue() q.put((1,0)) # 番号、深さ while(not q.empty()): x, d = q.get() if depth[x] != -1: continue depth[x] = d for next in adj[x]: if depth[next] == -1: q.put((next,d+1))