import re

def count_pattern_matches(L, D, N, words, patterns):
    results = []
    for pattern in patterns:
        regex_pattern = pattern.replace('(', '[').replace(')', ']')
        regex = re.compile(regex_pattern)
        matches = sum(1 for word in words if regex.fullmatch(word))
        results.append(matches)
    return results

def main():
    L, D, N = map(int, input().split())
    words = [input().strip() for _ in range(D)]
    patterns = [input().strip() for _ in range(N)]

    results = count_pattern_matches(L, D, N, words, patterns)

    for i, result in enumerate(results, start=1):
        print(f"Case #{i}: {result}")

if __name__ == "__main__":
    main()