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 Haskell (GHC 8.8.3) (judge verdict: Accepted)

import Control.Monad
import Data.Maybe
import Text.Printf
import qualified Data.ByteString.Char8 as C

parseInt :: C.ByteString -> Int
parseInt = fst . fromJust . C.readInt

toInt :: C.ByteString -> Int
toInt s
  | s == C.pack "BC" = 1
  | s == C.pack "AC" = 2
  | s == C.pack "AB" = 3

solve :: ([String], Int, Int, Int) -> [Int] -> Maybe [String]
solve (xs, _, _, _) [] = Just xs
solve (_, _, 0, 0) (1 : _) = Nothing
solve (_, 0, _, 0) (2 : _) = Nothing
solve (_, 0, 0, _) (3 : _) = Nothing
solve (xs, 0, 1, 1) (1 : p : ps) =
  case p of
    2 -> solve ("C" : xs, 0, 0, 2) (p : ps)
    _ -> solve ("B" : xs, 0, 2, 0) (p : ps)
solve (xs, 1, 0, 1) (2 : p : ps) =
  case p of
    1 -> solve ("C" : xs, 0, 0, 2) (p : ps)
    _ -> solve ("A" : xs, 2, 0, 0) (p : ps)
solve (xs, 1, 1, 0) (3 : p : ps) =
  case p of
    1 -> solve ("B" : xs, 0, 2, 0) (p : ps)
    _ -> solve ("A" : xs, 2, 0, 0) (p : ps)
solve (xs, a, b, c) (1 : ps)
  | b >= c = solve ("C" : xs, a, b - 1, c + 1) ps
  | otherwise = solve ("B" : xs, a, b + 1, c - 1) ps
solve (xs, a, b, c) (2 : ps)
  | a >= c = solve ("C" : xs, a - 1, b, c + 1) ps
  | otherwise = solve ("A" : xs, a + 1, b, c - 1) ps
solve (xs, a, b, c) (3 : ps)
  | a >= b = solve ("B" : xs, a - 1, b + 1, c) ps
  | otherwise = solve ("A" : xs, a + 1, b - 1, c) ps

main :: IO ()
main = do
  [n, a, b, c] <- map parseInt . C.words <$> C.getLine
  ps <- map toInt <$> replicateM n C.getLine
  putStr $ case solve ([], a, b, c) ps of
    Nothing -> "No\n"
    Just as -> "Yes\n" ++ unlines (reverse as)