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 PYTHON):

Solution:
from collections import Counter, defaultdict, deque
import itertools 
import bisect
from sys import stdin, stdout
from itertools import repeat
import sys


# sys.stdin = open('input')
# sys.stdout = open('/mnt/d/Gg/output', 'w')
# n, k = map(int, raw_input().split())
# da = map(int, raw_input().split())
# db = map(int, raw_input().split())




def main():
    n, a, b, c = map(int, raw_input().split())
    da = [a, b, c]
    ans = []
    query = []
    for i in range(n):
        query.append(raw_input().strip())
    
    def get(idx, x, y):
        if da[x]+da[y]==0:
            return
        if da[x]==1 and da[y]==1 and idx < n-1:
            if query[idx][0] not in query[idx+1]:
                ans.append(query[idx][1])
                da[x] -= 1
                da[y] += 1
            else:
                ans.append(query[idx][0])
                da[y] -= 1
                da[x] += 1
            return
        if da[x]>da[y]:
            ans.append(query[idx][1])
            da[y] += 1
            da[x] -= 1 
        else:
            ans.append(query[idx][0])
            da[y] -= 1
            da[x] += 1 

    for i in range(n):
        if query[i] == 'AB':
            get(i, 0, 1)
        elif query[i] == 'AC':
            get(i, 0, 2)
        else:
            get(i, 1, 2)
    if len(ans) < n:
        print "No"
    else:
        print "Yes"
        print '\n'.join(ans)

    
# import time
# pre = time.time()
main()