import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
import string

def solve(test):
    ci = li()
    S = string.ascii_uppercase
    pair = []
    n = ii()
    se = set()

    for _ in range(n):
        s = input()
        t = ''.join([str(ci[S.index(v)]) for v in s])
        se.add(t)
    print('Case #' + str(test) + ':', ('NO' if len(se) == n else 'YES')) 




for test in range(1, ii() + 1):
    solve(test)