### BUGGY CODE ###

#!/usr/bin/python3
import sys
import itertools
input = lambda: sys.stdin.readline().strip()
N, A, B, C = [int(x) for x in input().split()]
s = [input() for _ in range(N)]

def dp(A, B, C):
    summ = A + B + C
    perms = list(itertools.permutations('ABC'))

    def get_state(A, B, C):
        abc = sorted([(A, 'A'), (B, 'B'), (C, 'C')])
        return abc[0][0], abc[1][0], perms.index(tuple(label for count, label in abc))

    def get_abc(m1, m2, p):
        return dict(zip(perms[p], (m1, m2, summ - m1 - m2)))

    can = [[[[0 for p in range(6)] for m2 in range(4)] for m1 in range(4)] for i in range(N + 1)]
    mov = [[[[0 for p in range(6)] for m2 in range(4)] for m1 in range(4)] for i in range(N + 1)]
    for i in reversed(range(N + 1)):
        for m1 in range(4):
            for m2 in range(4):
                for p in range(6):
                    if i == N:
                        can[i][m1][m2][p] = True
                    elif summ - m1 - m2 >= 0:
                        abc = get_abc(m1, m2, p)
                        for j in (0, 1):
                            if abc[s[i][j ^ 1]] > 0:
                                abc[s[i][j]] += 1
                                abc[s[i][j ^ 1]] -= 1
                                mm1, mm2, pp = get_state(abc['A'], abc['B'], abc['C'])
                                if mm2 >= 4 or can[i + 1][mm1][mm2][pp]:
                                    can[i][m1][m2][p] = True
                                    mov[i][m1][m2][p] = j
                                abc[s[i][j]] -= 1
                                abc[s[i][j ^ 1]] += 1
    
    m1, m2, p = get_state(A, B, C)
    moves = []
    if can[0][m1][m2][p]:
        for i in range(N):
            moves.append(mov[i][m1][m2][p])
            abc = get_abc(m1, m2, p)
            abc[s[i][moves[-1]]] += 1
            abc[s[i][moves[-1] ^ 1]] -= 1
            m1, m2, p = get_state(abc['A'], abc['B'], abc['C'])
            if m2 >= 4:
                return greedy(abc['A'], abc['B'], abc['C'], i + 1, moves)
        return True, moves
    else:
        return False, []

def greedy(A, B, C, start=0, moves=[]):
    last = {'AB': 0, 'BC': 0, 'AC': 0}
    abc = {'A': A, 'B': B, 'C': C}
    can = True
    for x in s[start:]:
        if abc[x[0]] <= 1:
            last[x] = 0
        elif abc[x[1]] <= 1:
            last[x] = 1
        abc[x[last[x]]] += 1
        abc[x[last[x] ^ 1]] -= 1
        moves.append(last[x])
        last[x] ^= 1
        can &= all(x >= 0 for x in abc.values())
    return can, moves

if sum(1 for x in (A, B, C) if x < 4) >= 2:
    can, moves = dp(A, B, C)
else:
    can, moves = greedy(A, B, C)

if can:
    print('Yes')
    abc = {'A': A, 'B': B, 'C': C}
    for i in range(N):
        abc[s[i][moves[i]]] += 1
        abc[s[i][moves[i] ^ 1]] -= 1
        assert all(x >= 0 for x in abc.values())
    print(*(s[i][moves[i]] for i in range(N)), sep='\n')
else:
    print('No')

### FIXED CODE ###

#!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
N, A, B, C = [int(x) for x in input().split()]
s = [input() for _ in range(N)]
abc = {'A': A, 'B': B, 'C': C}
can = True
moves = []
for i in range(N):
    moves.append(next(j for j in (0, 1) if abc[s[i][j]] < abc[s[i][j ^ 1]] or abc[s[i][j]] == abc[s[i][j ^ 1]] and (i + 1 == N or s[i + 1] == s[i] or s[i][j ^ 1] not in s[i + 1])))
    abc[s[i][moves[-1]]] += 1
    abc[s[i][moves[-1] ^ 1]] -= 1
    can &= all(x >= 0 for x in abc.values())
if can:
    print('Yes')
    print(*(s[i][moves[i]] for i in range(N)), sep='\n')
else:
    print('No')