Problem: 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.

Examples

Input

2 1 3 0
AB
AC


Output

Yes
A
C


Input

3 1 0 0
AB
BC
AB


Output

No


Input

1 0 9 0
AC


Output

No


Input

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


Output

Yes
C
B
B
C
C
B
A
A

Solution (in PYTHON3):

Solution:
# -*- coding: utf-8 -*-
n,a,b,c = list(map(int,input().split()))
abc = [a,b,c]
s = [tuple(map(lambda x:ord(x)-97,list(input().lower()))) for i in range(n)]

from copy import deepcopy

s.append(deepcopy(s[-1]))
ret = True
ret_choice = []
ra = ret_choice.append
for i,j in zip(s,s[1::]):
    #i[0]で+1,i[1]で-1をする場合
    if abc[i[0]] >=3  and abc[i[1]] >=3:
        abc[i[0]]+=1
        abc[i[1]]-=1
        ra(i[0])
    elif abc[i[0]] >=3 and abc[i[1]] < 3:
        abc[i[0]]-=1
        abc[i[1]]+=1
        ra(i[1])
    elif abc[i[0]] <3 and abc[i[1]] >= 3:
        abc[i[0]]+=1
        abc[i[1]]-=1
        ra(i[0])
    elif abc[i[0]]==0:
        abc[i[0]]+=1
        abc[i[1]]-=1
        ra(i[0])
    elif abc[i[1]]==0:
        abc[i[0]]-=1
        abc[i[1]]+=1
        ra(i[1])
    elif i[0] in j:
        abc[i[0]]+=1
        abc[i[1]]-=1
        ra(i[0])
    else:
        abc[i[0]]-=1
        abc[i[1]]+=1
        ra(i[1])
    if -1 in abc:
        ret = False
        break

if ret:
    print("Yes")
    for i in (map(lambda x:chr(x+65),ret_choice)):
        print(i)
else:
    print("No")