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)