#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, m;
string data[10];

int different(string a, string b) {
    if (a.size() != b.size())
        return 2;

    int res = 0;

    for (int i = 0; i < a.size(); ++i)
        if (a[i] != b[i]) res++;

    return res;
}

bool test(string q) {
    int count = 0;
    for (int i = 0; i < n; ++i)
    {
        int r = different(q, data[i]);
        if (r == 0) return true;
        if (r == 1) count++;
    }
    return (count == 1);
}

void solve() {
    cin >> n >> m;

    for (int i = 0; i < n; ++i)
        cin >> data[i];

    for (int i = 0; i < m; ++i)
    {
        string q;
        cin >> q;
        if (test(q)) {
            cout << "yes" << endl;
        } else {
            cout << "no" << endl;
        }
    }
}

int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
    {
        cout << "Case #" << i+1 << ":" << endl;
        solve();
    }
    return 0;
}