#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int n, m;
    cin >> n >> m;

    string s, t;
    string sol(5, '-');
    vector<int> freq(26), mxFreq(26, 6);
    for (int i = 0; i < n; i++) {
        cin >> s >> t;

        vector<int> curFreq(26);
        for (int j = 0; j < 5; j++) {
            if (t[j] != '-')
                curFreq[s[j] - 'A']++;

            if (t[j] == 'G')
                sol[j] = s[j];
        }

        for (int j = 0; j < 5; j++) {
            if (t[j] == '-')
                mxFreq[s[j] - 'A'] = min(mxFreq[s[j] - 'A'], curFreq[s[j] - 'A']);
        }

        for (int j = 0; j < 26; j++)
            freq[j] = max(freq[j], curFreq[j]);
    }

    while (m--) {
        cin >> s;

        vector<int> curFreq(26);
        for (auto &i: s)
            curFreq[i - 'A']++;

        bool valid = 1;
        for (int i = 0; i < 26; i++) {
            if (freq[i] > curFreq[i] || curFreq[i] > mxFreq[i])
                valid = 0;
        }

        for (int i = 0; i < 5; i++) {
            if (sol[i] != '-' && sol[i] != s[i])
                valid = 0;
        }

        if (valid)
            cout << s << el;
    }
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}