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 Rust (1.42.0) (judge verdict: Accepted)

#![allow(unused)]

use std::cmp::min;

//
// Based on EbTech's Scanner https://stackoverflow.com/q/56449027
//
struct Scanner<'a, R: std::io::BufRead> {
    reader: R,
    buf: String,
    iter: std::str::SplitWhitespace<'a>,
}

impl<'a, R: std::io::BufRead> Scanner<'a, R> {
    fn new(reader: R) -> Self {
        Self { reader, buf: String::new(), iter: "".split_whitespace() }
    }

    fn get_str(&mut self) -> &str {
        if let Some(t) = self.iter.next() {
            return t;
        }
        self.buf.clear();
        self.reader.read_line(&mut self.buf).expect("I/O error");
        self.iter = unsafe { std::mem::transmute(self.buf.split_whitespace()) };
        self.get_str()
    }

    fn get<T: std::str::FromStr>(&mut self) -> T {
        self.get_str().parse().ok().expect("Parse error")
    }
}

fn main() {
    let stdin = std::io::stdin();
    solve(Scanner::new(stdin.lock()));
}

fn solve<R: std::io::BufRead>(mut sc: Scanner<R>) {
    let n: usize = sc.get();
    let a: i64 = sc.get();
    let b: i64 = sc.get();
    let c: i64 = sc.get();
    let ss: Vec<String> = (0..n).map(|_| sc.get()).collect();

    let choises: Vec<char> = if a + b + c == 0 {
        vec![]
    } else if a + b + c == 1 {
        (0..n).scan((a, b, c), |stat, i| {
            match (*stat, ss[i].as_str()) {
                ((1, 0, 0), "AB") => Some(('B', (0, 1, 0))),
                ((1, 0, 0), "BC") => None,
                ((1, 0, 0), "AC") => Some(('C', (0, 0, 1))),
                ((0, 1, 0), "AB") => Some(('A', (1, 0, 0))),
                ((0, 1, 0), "BC") => Some(('C', (0, 0, 1))),
                ((0, 1, 0), "AC") => None,
                ((0, 0, 1), "AB") => None,
                ((0, 0, 1), "BC") => Some(('B', (0, 1, 0))),
                ((0, 0, 1), "AC") => Some(('A', (1, 0, 0))),
                _ => unreachable!(),
            }.map(|(chosen, stat_)| { *stat = stat_; chosen })
        }).collect()
    } else {
        // 状態を (1, 1, 0), (2, 0, 0) とこれらを並べ替えたものの合計6状態へ集約
        let mut init = match [a, b, c].iter().filter(|&&x| x == 0).count() {
            0 => (1, 1, 0),
            1 => (min(a, 1), min(b, 1), min(c, 1)),
            _ => (min(a, 2), min(b, 2), min(c, 2)),
        };
        (0..n).scan(init, |stat, i| {
            let adv = if i < n - 1 { ss[i + 1].as_str() } else { "" };
            match (*stat, ss[i].as_str(), adv) {
                ((2, 0, 0), "AB", _   ) => Some(('B', (1, 1, 0))),
                ((2, 0, 0), "BC", _   ) => None,
                ((2, 0, 0), "AC", _   ) => Some(('C', (1, 0, 1))),
                ((1, 1, 0), "AB", "BC") => Some(('B', (0, 2, 0))),
                ((1, 1, 0), "AB", _   ) => Some(('A', (2, 0, 0))),
                ((1, 1, 0), "BC", _   ) => Some(('C', (1, 0, 1))),
                ((1, 1, 0), "AC", _   ) => Some(('C', (0, 1, 1))),
                ((0, 2, 0), "AB", _   ) => Some(('A', (1, 1, 0))),
                ((0, 2, 0), "BC", _   ) => Some(('C', (0, 1, 1))),
                ((0, 2, 0), "AC", _   ) => None,
                ((0, 1, 1), "AB", _   ) => Some(('A', (1, 0, 1))),
                ((0, 1, 1), "BC", "AB") => Some(('B', (0, 2, 0))),
                ((0, 1, 1), "BC", _   ) => Some(('C', (0, 0, 2))),
                ((0, 1, 1), "AC", _   ) => Some(('A', (1, 1, 0))),
                ((0, 0, 2), "AB", _   ) => None,
                ((0, 0, 2), "BC", _   ) => Some(('B', (0, 1, 1))),
                ((0, 0, 2), "AC", _   ) => Some(('A', (1, 0, 1))),
                ((1, 0, 1), "AB", _   ) => Some(('B', (0, 1, 1))),
                ((1, 0, 1), "BC", _   ) => Some(('B', (1, 1, 0))),
                ((1, 0, 1), "AC", "AB") => Some(('A', (2, 0, 0))),
                ((1, 0, 1), "AC", _   ) => Some(('C', (0, 0, 2))),
                _ => unreachable!(),
            }.map(|(chosen, stat_)| { *stat = stat_; chosen })
        }).collect()
    };

    if choises.len() < n {
        println!("No");
    } else {
        println!("Yes");
        for c in choises {
            println!("{}", c);
        }
    }
}