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: Wrong Answer)

if __name__ == '__main__':
    from sys import stdin
    # from collections import defaultdict
    # from collections import deque
    # from collections import Counter
    import math
    # import random
    input = stdin.readline


    n, a, b, c = map(int, input().split())

    count_ss = {'AB':0, 'AC':0, 'BC':0}
    ss = ['']*n
    for i in range(n):
        ss[i] = input()[:-1]
        count_ss[ss[i]] += 1

    need_a = math.ceil(-1*((a-n+count_ss['BC']))/2)
    need_b = math.ceil(-1*((b-n+count_ss['AC']))/2)
    need_c = math.ceil(-1*((c-n+count_ss['AB']))/2)
    if need_a < 0:
        need_a = 0
    if need_b < 0:
        need_b = 0
    if need_c < 0:
        need_c = 0
    # print(need_a, need_b, need_c)
    for i in range(count_ss['AB']+1):
        ac_a = max([need_a-i, 0])
        if ac_a > count_ss['AC']:
            continue
        ac_c = count_ss['AC']-ac_a
        bc_c = max([need_c-ac_c, 0])
        if bc_c > count_ss['BC']:
            continue
        if count_ss['BC'] - bc_c + count_ss['AB'] - i >= need_b:
            break
    else:
        print('No')
        exit()
    bc_b = count_ss['BC']-bc_c
    ab_a = i
    print('Yes')
    for s in ss:
        if s == 'AB':
            if ab_a > 0:
                print('A')
                ab_a -= 1
            else:
                print('B')
        if s == 'BC':
            if bc_b > 0:
                print('B')
                bc_b -= 1
            else:
                print('C')
        if s == 'AC':
            if ac_a > 0:
                print('A')
                ac_a -= 1
            else:
                print('C')