You have a simple system in which you want to have a search function. You decided to implement it for searching email addresses. There is a bunch of email addresses in your program.
User enters an email address. And the function detects if there is one. If yes, then its answer is “yes”, otherwise it tries to change one symbol in the entered address (the error detection). Then, if it matches only one address, the answer is still “yes”. But if it detects more than one address or does not detect anything, the answer is “no“.
The first line contains the number of test cases _T_ (T ≤ 100). The first line of each test case contains the number of email addresses in the program _n_ and the number of queries _m_ (1 ≤ n, m ≤ 10). The following _n_ lines contain email addresses (only lowercase letters, digits and symbols “@”, “.”). The following m lines contain an email address, which is searched (only lowercase letters, digits and symbols “@”, “.”).
Note: the length of email addresses doesn’t exceed 100.
For each test case output one line containing “_Case #tc:_”, where _tc_ is the number of the test case (starting from 1). Then output _m_ lines containing answers to the queries (“_yes_” or “_no_”).
## Input
The first line contains the number of test cases _T_ (T ≤ 100). The first line of each test case contains the number of email addresses in the program _n_ and the number of queries _m_ (1 ≤ n, m ≤ 10). The following _n_ lines contain email addresses (only lowercase letters, digits and symbols “@”, “.”). The following m lines contain an email address, which is searched (only lowercase letters, digits and symbols “@”, “.”).Note: the length of email addresses doesn’t exceed 100.
## Output
For each test case output one line containing “_Case #tc:_”, where _tc_ is the number of the test case (starting from 1). Then output _m_ lines containing answers to the queries (“_yes_” or “_no_”).
[samples]
**Definitions**
Let $ T \in \mathbb{Z} $ be the number of test cases.
For each test case $ tc \in \{1, \dots, T\} $:
- Let $ n, m \in \mathbb{Z} $ denote the number of stored email addresses and queries, respectively.
- Let $ E = \{e_1, e_2, \dots, e_n\} $ be the set of stored email addresses, where each $ e_i $ is a string over the alphabet $ \Sigma = \{ \text{lowercase letters}, \text{digits}, @, . \} $.
- Let $ Q = \{q_1, q_2, \dots, q_m\} $ be the set of query email addresses, each $ q_j \in \Sigma^* $.
**Constraints**
1. $ 1 \le T \le 100 $
2. For each test case:
- $ 1 \le n \le 10 $, $ 1 \le m \le 10 $
- $ |e_i| \le 100 $, $ |q_j| \le 100 $ for all $ i,j $
- All strings contain only characters from $ \Sigma $
**Objective**
For each query $ q_j $:
- If $ q_j \in E $, output “yes”.
- Else, let $ D(q_j) = \{ e \in E \mid \text{Hamming distance}(q_j, e) = 1 \} $.
- If $ |D(q_j)| = 1 $, output “yes”.
- Otherwise (i.e., $ |D(q_j)| \ne 1 $), output “no”.