#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;

bool valid(string &s, string &t, string &p) {
    for (int i = 0; i < 5; i++) {
        if (p[i] == 'G' && s[i] != t[i])
            return 0;
    }

    vector<int> freq(26), mn(26), mx(26, 6);
    for (int i = 0; i < 5; i++) {
        if (p[i] == 'G')
            continue;

        freq[s[i] - 'A']++;

        if (p[i] == '-')
            mx[t[i] - 'A'] = mn[t[i] - 'A'];
        else
            mn[t[i] - 'A']++;
    }

    for (int i = 0; i < 26; i++) {
        if (freq[i] > mx[i] || freq[i] < mn[i])
            return 0;
    }

    return 1;
}

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

    vector<string> v(n), p(n);
    for (int i = 0; i < n; i++)
        cin >> v[i] >> p[i];

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

        bool can = 1;
        for (int i = 0; i < n; i++)
            can &= valid(s, v[i], p[i]);

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

signed main() {
    Beevo

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

    while (T--)
        testCase();

    return 0;
}