#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
const int INF = 1000000000;
struct Edge {
  int from, to, cap, flow;
};
bool operator<(const Edge& a, const Edge& b) {
  return a.from < b.from || (a.from == b.from && a.to < b.to);
}
struct Dinic {
  int n, m, s, t;
  vector<Edge> edges;
  vector<int> G[maxn];
  bool vis[maxn];
  int d[maxn];
  int cur[maxn];
  void ClearAll(int n) {
    for (int i = 0; i < n; i++) G[i].clear();
    edges.clear();
  }
  void ClearFlow() {
    for (int i = 0; i < (int)edges.size(); i++) edges[i].flow = 0;
  }
  void AddEdge(int from, int to, int cap) {
    edges.push_back((Edge){from, to, cap, 0});
    edges.push_back((Edge){to, from, 0, 0});
    m = edges.size();
    G[from].push_back(m - 2);
    G[to].push_back(m - 1);
  }
  bool BFS() {
    memset(vis, 0, sizeof(vis));
    queue<int> Q;
    Q.push(s);
    vis[s] = 1;
    d[s] = 0;
    while (!Q.empty()) {
      int x = Q.front();
      Q.pop();
      for (int i = 0; i < (int)G[x].size(); i++) {
        Edge& e = edges[G[x][i]];
        if (!vis[e.to] && e.cap > e.flow) {
          vis[e.to] = 1;
          d[e.to] = d[x] + 1;
          Q.push(e.to);
        }
      }
    }
    return vis[t];
  }
  int DFS(int x, int a) {
    if (x == t || a == 0) return a;
    int flow = 0, f;
    for (int& i = cur[x]; i < (int)G[x].size(); i++) {
      Edge& e = edges[G[x][i]];
      if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0) {
        e.flow += f;
        edges[G[x][i] ^ 1].flow -= f;
        flow += f;
        a -= f;
        if (a == 0) break;
      }
    }
    return flow;
  }
  int Maxflow(int s, int t) {
    this->s = s;
    this->t = t;
    int flow = 0;
    while (BFS()) {
      memset(cur, 0, sizeof(cur));
      flow += DFS(s, INF);
    }
    return flow;
  }
  vector<int> Mincut() {
    vector<int> ans;
    for (int i = 0; i < (int)edges.size(); i++) {
      Edge& e = edges[i];
      if (vis[e.from] && !vis[e.to] && e.cap > 0) ans.push_back(i);
    }
    return ans;
  }
  void Reduce() {
    for (int i = 0; i < (int)edges.size(); i++) edges[i].cap -= edges[i].flow;
  }
};
Dinic g;
int n, a[10];
char s[20], sp[20];
char mat[70][10] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
vector<int> vec[maxn];
void add(int i, char* p) {
  for (int k = 1; k <= 6; k++)
    if (strcmp(p, mat[k]) == 0) {
      g.AddEdge(i, n + k, 1);
      vec[i].push_back(k);
    }
}
int main() {
  for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
  scanf("%d", &n);
  g.ClearAll(n + 8);
  for (int i = 1; i <= 6; i++) g.AddEdge(n + i, n + 7, a[i]);
  for (int i = 1; i <= n; i++) {
    vec[i].clear();
    g.AddEdge(0, i, 1);
    scanf("%s", s);
    bool div = 0;
    int len = strlen(s);
    for (int j = 0; j < len; j++)
      if (s[j] == ',') {
        div = 1;
        for (int k = 0; k < j; k++) sp[k] = s[k];
        sp[j] = '\0';
        add(i, sp);
        for (int k = j + 1; k < len; k++) sp[k - j - 1] = s[k];
        sp[len - j - 1] = '\0';
        add(i, sp);
      }
    if (!div) add(i, s);
  }
  int flow = g.Maxflow(0, n + 7);
  if (flow < n)
    puts("NO");
  else {
    puts("YES");
    for (int x = 1; x <= n; x++)
      for (int i = 0; i < (int)g.G[x].size(); i++) {
        Edge& e = g.edges[g.G[x][i]];
        if (e.from != x) continue;
        if (e.cap != e.flow || e.cap == 0) continue;
        printf("%s\n", mat[e.to - n]);
      }
  }
  return 0;
}
