Problem:
Score : 600 points

Problem Statement

There is a game that involves three variables, denoted A, B, and C.

As the game progresses, there will be N events where you are asked to make a choice.
Each of these choices is represented by a string s_i. If s_i is AB, you must add 1 to A or B then subtract 1 from the other; if s_i is AC, you must add 1 to A or C then subtract 1 from the other; if s_i is BC, you must add 1 to B or C then subtract 1 from the other.

After each choice, none of A, B, and C should be negative.

Determine whether it is possible to make N choices under this condition. If it is possible, also give one such way to make the choices.

Constraints

1 \leq N \leq 10^5

0 \leq A,B,C \leq 10^9

N, A, B, C are integers.

s_i is AB, AC, or BC.

Input

Input is given from Standard Input in the following format:

N A B C
s_1
s_2
:
s_N

Output

If it is possible to make N choices under the condition, print Yes; otherwise, print No.

Also, in the former case, show one such way to make the choices in the subsequent N lines. The (i+1)-th line should contain the name of the variable (A, B, or C) to which you add 1 in the i-th choice.

Sample Input 1

2 1 3 0
AB
AC

Sample Output 1

Yes
A
C

You can successfully make two choices, as follows:

In the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.

In the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.

Sample Input 2

3 1 0 0
AB
BC
AB

Sample Output 2

No

Sample Input 3

1 0 9 0
AC

Sample Output 3

No

Sample Input 4

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB

Sample Output 4

Yes
C
B
B
C
C
B
A
A

Solution in Python (3.8.2) (judge verdict: Accepted)

n, a, b, c = map(int, input().split())
ls = []
for _ in range(n):
    ls.append(input())

abc = {'A': a, 'B': b, 'C': c}

def answer():
    solution = []
    if a + b + c == 0:
        return False, None
    elif a + b + c == 1:
        for s in ls:
            s0, s1 = s[0], s[1]
            if abc[s0] == 1:
                abc[s0] -= 1
                abc[s1] += 1
                solution.append(s1)
            elif abc[s1] == 1:
                abc[s0] += 1
                abc[s1] -= 1
                solution.append(s0)
            else:
                return False, None
        return True, solution
    else:
        for i, s in enumerate(ls):
            s0, s1 = s[0], s[1]
            if abc[s0] == 0 and abc[s1] == 0:
                return False, None
            elif i == n - 1:
                if abc[s0] == 0:
                    abc[s0] += 1
                    abc[s1] -= 1
                    solution.append(s0)
                else:
                    abc[s0] -= 1
                    abc[s1] += 1
                    solution.append(s1)
            elif abc[s0] == 0:
                abc[s0] += 1
                abc[s1] -= 1
                solution.append(s0)
            elif abc[s1] == 0:
                abc[s0] -= 1
                abc[s1] += 1
                solution.append(s1)
            elif abc[s0] == 1 and (s0 in ls[i + 1]):
                abc[s0] += 1
                abc[s1] -= 1
                solution.append(s0)
            else:
                abc[s0] -= 1
                abc[s1] += 1
                solution.append(s1)
        return True, solution


yn, solution = answer()
if yn:
    print('Yes')
    for s in solution:
        print(s)
else:
    print('No')