#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

//----------------------------------------------------------------

int main() {
  int n, w;
  string t, result, guess, inc = "";
  vector<string> black(5), white(5), ex(5);
  cin >> n >> w;
  for (int i = 0; i < n; i++) {
    string temp;
    cin >> t >> result;
    for (int j = 0; j < 5; j++) {
      if (result[j] == '-') {
        black[j] += t[j];
      }
      if (result[j] == 'G') {
        white[j] += t[j];
      }
      if (result[j] == 'Y') {
        ex[j] += t[j];
        inc += t[j];
      }
    }
  }
  for (int i = 0; i < w; i++) {
    cin >> guess;
    bool flag = false;
    string inc_test = inc;
    for (int j = 0; j < 5; j++) {
      if (black[j].find(guess[j]) != std::string::npos ||
          ex[j].find(guess[j]) != std::string::npos) {
        flag = false;
        break;
      }
      if (white[j].size() > 0 && white[j][0] != guess[j]) {
        flag = false;
        break;
      }
      size_t pos = inc_test.find_first_of(guess[j]);
      if (pos != std::string::npos) {
        inc_test.erase(pos);
        continue;
      }
      flag = true;
    }
    if (flag && inc_test.size() == 0) {
      cout << guess << endl;
    }
  }
  return 0;
}