#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 5e4 + 5;
int n, m;
string s[15], feedback[15];
vector<pair<int, string>> ans;
int trie[N][26];
int mark[N], id = 1;
void add(string s, int i) {
	int v = 0;
	for(auto j : s) {
		int c = j - 'A';
		if(!trie[v][c])
			trie[v][c] = id++;
		v = trie[v][c];
	}
	mark[v] = i;
}
void solve(int i, int v, string cur) {
	if(i == 5) {
		for(int k = 0;k < n;k++) {
			map<char, int> tmp, now;
			for(int j = 0;j < 5;j++) {
				if((feedback[k][j] == '-' || feedback[k][j] == 'Y') && cur[j] == s[k][j])
					return;
				else if(feedback[k][j] == 'G' && cur[j] != s[k][j])
					return;
				if(feedback[k][j] == 'Y')
					tmp[s[k][j]]++;
				now[cur[j]]++;
			}
			for(auto j : tmp)
				if(now[j.first] < j.second)
					return;
		}
		ans.push_back({mark[v], cur});
		return;
	}
	for(char c = 'A';c <= 'Z';c++)
		if(trie[v][c - 'A'])
			solve(i + 1, trie[v][c - 'A'], cur + c);
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0;i < n;i++)
		cin >> s[i] >> feedback[i];
	for(int i = 0;i < m;i++) {
		string w;
		cin >> w;
		add(w, i);
	}
	solve(0, 0, "");
	sort(ans.begin(), ans.end());
	for(auto i : ans)
		cout << i.second << '\n';
    return 0;
}