#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 = 1e3 + 5;
int n, m;
char p[5];
set<char> np[5];
map<char, int> mx;
map<string, int> mp;
vector<pair<int, string>> ans;
void solve(int i, string cur) {
	if(i == 5) {
		map<char, int> tmp;
		for(auto j : cur)
			tmp[j]++;
		for(auto j : mx) {
			if(tmp[j.first] < j.second)
				return;
		}
		if(mp.count(cur))
			ans.push_back({mp[cur], cur});
		return;
	}
	if(p[i] != '?')
		solve(i + 1, cur + p[i]);
	else {
		for(char c = 'A';c <= 'Z';c++) {
			if(np[i].count(c))
				continue;
			solve(i + 1, cur + c);
		}
	}
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0;i < 5;i++)
		p[i] = '?';
    for(int i = 0;i < n;i++) {
		string s, feedback;
		cin >> s >> feedback;
		map<char, int> f;
		for(int j = 0;j < 5;j++) {
			if(feedback[j] == 'G') {
				f[s[j]]++;
				p[j] = s[j];
			} else if(feedback[j] == 'Y') {
				f[s[j]]++;
				mx[s[j]] = max(mx[s[j]], f[s[j]]);
				np[j].insert(s[j]);
			} else {
				for(int k = 0;k < 5;k++)
					np[j].insert(s[j]);
			}
		}
	}
	for(int i = 0;i < m;i++) {
		string s;
		cin >> s;
		mp[s] = i;
	}
	solve(0, "");
	sort(ans.begin(), ans.end());
	for(auto i : ans)
		cout << i.second << '\n';
    return 0;
}