diamondinheritance

import sys
import os
if not os.environ.get("ONLINE_JUDGE"):
    sys.stdin = open('./in.txt', 'r')
    sys.stdout = open('./out.txt', 'w')

def dfs(u,visited):
    visited[u] = True
    for edges in al[u]:
        v,w = edges
        if not visited[v]:
            dfs(v,visited)
        else:
            return True

for t in range(int(input())):
    n =int(input())
    al = [[] for _ in range(n+1)]

    for u in range(1,n+1):
        line = list(map(int,input().split()))
        no_classes = line[0]
        for v in line[1:]:
            al[u].append([v,0])

    # print(al)
    for node in range(1,n+1):
        visited = [False] * (n+1)
        if dfs(node,visited):
            print(f"Case #{t+1}: Yes")
            break
    else:
        print(f"Case #{t+1}: No")