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.

Input is given from Standard Input in the following format:
$N\ A\ B\ C$
$s_1$
$s_2$
$:$
$s_N$

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.

$1≤N≤10^5$
$0 \leq A,B,C \leq 10^9$
$N, A, B, C$ are integers.
$s_i$ is AB, AC, or BC.

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$.