#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 1e4 + 5, M = 350;
const ld PI = acos(-1.0), EPS = 1e-9;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, a[N], m, mn[26], mx[26];
string s[N], ans;

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    fill(mx, mx + 26, 5);
    ans = "-----";
    cin >> n >> m;
    while (n--) {
        string s1, s2;
        cin >> s1 >> s2;
        int f[26] = {0}, no[26] = {0};
        for (int i = 0; i < 5; i++) {
            if (s2[i] == 'G') ans[i] = s1[i];
            if (s2[i] != '-') f[s1[i] - 'A']++;
            if (s2[i] == '-') no[s1[i] - 'A'] = 1;
        }
        for (int i = 0; i < 26; i++) {
            mn[i] = max(mn[i], f[i]);
            if (no[i]) mx[i] = min(mx[i], f[i]);
        }
    }
    while (m--) {
        string s;
        cin >> s;
        bool yes = 1;
        int f[26] = {0};
        for (int i = 0; i < 5; i++) {
            if (ans[i] != '-' && s[i] != ans[i]) yes = 0;
            f[s[i] - 'A']++;
        }
        for (int i = 0; i < 26; i++) if (f[i] < mn[i] || f[i] > mx[i]) yes = 0;
        if (yes) cout << s << '\n';
    }
    return 0;
}