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:
import sys
input = sys.stdin.readline
N, A, B, C = map(int, input().split())
res = [""] * N
ab = []
ac = []
bc = []
def no():
  print("No")
  exit(0)
for i in range(N):
  s = input()[: -1]
  if s == "AB":
    ab.append(i)
    A -= 1
    B -= 1
    if A < 0:
      if len(ac):
        A += 2
        res[ac.pop()] = "A"
      elif len(ab):
        A += 2
        res[ab.pop()] = "A"
    if B < 0:
      if len(bc):
        B += 2
        res[bc.pop()] = "B"
      elif len(ab):
        B += 2
        res[ab.pop()] = "B"

  if s == "AC":
    ac.append(i)
    A -= 1
    C -= 1
    if A < 0:
      if len(ab):
        A += 2
        res[ab.pop()] = "A"
      elif len(ac):
        A += 2
        res[ac.pop()] = "A"
    if C < 0:
      if len(bc):
        C += 2
        res[bc.pop()] = "C"
      elif len(ac):
        C += 2
        res[ac.pop()] = "C"

  if s == "BC":
    bc.append(i)
    B -= 1
    C -= 1
    if B < 0:
      if len(ab):
        B += 2
        res[ab.pop()] = "B"
      elif len(bc):
        B += 2
        res[bc.pop()] = "B"
    if C < 0:
      if len(ac):
        C += 2
        res[ac.pop()] = "C"
      elif len(bc):
        C += 2
        res[bc.pop()] = "C"

  if min(A, B, C) < 0: no()

for x in ab: res[x] = "A"
for x in ac: res[x] = "A"
for x in bc: res[x] = "B"
print("Yes")
for r in res: print(r)