#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

string wildcard;
vector<string> word;
bool cache[101][101];
bool search(int num, int w, int s) {
    if (cache[w][s] != false) return cache[w][s];
    if (w < wildcard.size() && s < word[num].size() && (wildcard.at(w) == '?' || wildcard.at(w) == word[num].at(s))) {
        return cache[w][s] = search(num, w + 1, s + 1);
    }
    if (w == wildcard.size()) return cache[w][s] = (s == word[num].size());
    if (wildcard.at(w) == '*') {
        if (search(num, w + 1, s) || (s < word[num].size() && search(num, w, s + 1)))   return cache[w][s] = true;
    }
    return cache[w][s] = false;


}

int main(void) {
    int num;
    int wordnum;

    cin >> num; //반복 횟수
    for (int i = 0; i < num; i++) {
        cin >> wildcard;
        cin >> wordnum;
        word.clear();
        for (int j = 0; j < wordnum; j++) {
            string temp;
            cin >> temp;
            word.push_back(temp);
        }
        for (int j = 0; j < word.size(); j++){
            for (int i = 0; i < 100; i++) {
                for (int j = 0; j < 100; j++) {
                    cache[i][j] = false;
                }
            }
            if (!search(j, 0, 0)) word.erase(word.begin() + j);
        }
        sort(word.begin(), word.end());
        for (int j = 0; j < word.size(); j++) {
            cout << word[j] << endl;
        }
    }

    return 0;
}