use std::collections::HashMap;
#[derive(Default)]
//NOTE
//declare variables to reduce the number of parameters for dp and dfs etc.
struct Solver {
    n: usize,
    a: i64,
    b: i64,
    c: i64,
    ss: Vec<String>,
    paths: Vec<char>,
    dp: HashMap<(usize, i64, i64, i64), bool>,
}

impl Solver {

    fn memo(&mut self, pos: usize, aa: i64, bb: i64, cc: i64
    ) -> bool {
        if pos >= self.n {
            return true;
        }

        let a = self.a + aa;
        let b = self.b + bb;
        let c = self.c + cc;
        if let Some(p) = self.dp.get(&(pos, aa, bb, cc)) {
            return *p;
        }

        if self.ss[pos] == "AB" {
            if a - 1 >= 0 {
                self.paths.push('B');
                if self.memo(pos + 1, aa - 1, bb + 1, cc) {
                    return true;
                }
                self.paths.pop();
            }
            if b - 1 >= 0 {
                self.paths.push('A');
                if self.memo(pos + 1, aa + 1, bb - 1, cc) {
                    return true;
                }
                self.paths.pop();
            }
        } else if self.ss[pos] == "AC" {
            if a - 1 >= 0 {
                self.paths.push('C');
                if self.memo(pos + 1, aa - 1, bb, cc + 1) {
                    return true;
                }
                self.paths.pop();
            }
            if c - 1 >= 0 {
                self.paths.push('A');
                if self.memo(pos + 1, aa + 1, bb, cc - 1) {
                    return true;
                }
                self.paths.pop();
            }
        } else if self.ss[pos] == "BC" {
            if b - 1 >= 0 {
                self.paths.push('C');
                if self.memo(pos + 1, aa, bb - 1, cc + 1) {
                    return true;
                }
                self.paths.pop();
            }
            if c - 1 >= 0 {
                self.paths.push('B');
                if self.memo(pos + 1, aa, bb + 1, cc - 1) {
                    return true;
                }
                self.paths.pop();
            }
        }
        self.dp.insert((pos, aa, bb, cc), false);
        false
    }
    fn solve(&mut self) {
        let stdin = std::io::stdin();
        let mut scn = Scanner {
            stdin: stdin.lock(),
        };
        let n: usize = scn.read();
        let a: i64 = scn.read();
        let b: i64 = scn.read();
        let c: i64 = scn.read();
        let ss: Vec<_> = (0..n).map(|_| scn.read::<String>()).collect();

        self.n = n;
        self.a = a;
        self.b = b;
        self.c = c;
        self.ss = ss;
        if self.memo(0, 0, 0, 0) {
            println!("Yes");
            for x in self.paths.iter() {
                println!("{}", x);
            }
        } else {
            println!("No");
        }
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| {
            let mut solver = Solver::default();
            solver.solve()
        })
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 21040