{-# LANGUAGE TypeApplications #-}
module Main where
import qualified Data.ByteString.Char8         as BS
import qualified Data.ByteString.Lazy.Char8    as BSL
import qualified Data.ByteString.Builder       as BSB
import           Data.Char                      ( isSpace )
import           Data.List
import           Control.Monad

data Query = AB | AC | BC deriving (Show, Eq, Read)
data Decision = A | B | C deriving (Show, Eq)

main :: IO ()
main = do
  [n, a, b, c] <- unfoldr (BS.readInt . BS.dropWhile isSpace) <$> BS.getLine
  ss           <- replicateM n (readLn @Query)
  let qa                    = length $ filter (/= BC) ss
  let qb                    = length $ filter (/= AC) ss
  let qc                    = length $ filter (/= AB) ss
  let ans                   = mapAccumL f (a, b, c, qa, qb, qc) ss
  let (a', b', c', _, _, _) = fst ans
  pr $ if a' >= 0 && b' >= 0 && c' >= 0 then Just (snd ans) else Nothing
 where
  f (a, b, c, qa, qb, qc) AB = if a - qa >= b - qb
    then ((a - 1, b + 1, c, qa - 1, qb - 1, qc), B)
    else ((a + 1, b - 1, c, qa - 1, qb - 1, qc), A)
  f (a, b, c, qa, qb, qc) AC = if a - qa >= c - qc
    then ((a - 1, b, c + 1, qa - 1, qb, qc - 1), C)
    else ((a + 1, b, c - 1, qa - 1, qb, qc - 1), A)
  f (a, b, c, qa, qb, qc) BC = if b - qb >= c - qc
    then ((a, b - 1, c + 1, qa, qb - 1, qc - 1), C)
    else ((a, b + 1, c - 1, qa, qb - 1, qc - 1), B)

pr (Just ans) = do
  putStrLn "Yes"
  mapM_ print ans
pr Nothing = putStrLn "No"
