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)

use std::io::{stdin, Read, StdinLock};
use std::str::FromStr;

#[allow(dead_code)]
struct Scanner<'a> {
    cin: StdinLock<'a>,
}
#[allow(dead_code)]
impl<'a> Scanner<'a> {
    fn new(cin: StdinLock<'a>) -> Scanner<'a> {
        Scanner { cin: cin }
    }

    fn read<T: FromStr>(&mut self) -> Option<T> {
        let token = self.cin.by_ref().bytes().map(|c| c.unwrap() as char)
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        token.parse::<T>().ok()
    }

    fn input<T: FromStr>(&mut self) -> T {
        self.read().unwrap()
    }

    fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.input()).collect()
    }

    fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }
}

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin);

    let n: usize = sc.input();
    let a: usize = sc.input();
    let b: usize = sc.input();
    let c: usize = sc.input();
    let ss: Vec<String> = sc.vec(n);

    let mut ans = vec![];
    dfs(0, a as i64, b as i64, c as i64, &ss, &mut ans);

    if ans.len() == 0 {
        println!("{}", "No");
    } else {
        println!("{}", "Yes");
        ans.reverse();
        for ch in ans {
            println!("{}", ch);
        }
    }
}


fn dfs(cur: i64, a: i64, b: i64, c: i64, ss: &Vec<String>, mut ans: &mut Vec<char>) -> bool {
    let n = ss.len();
    if cur == n as i64 {
        return true;
    }

    match &*ss[cur as usize] {
        "AB" => {
            if a == 0 && b == 0 {
                false
            } else if 0 < a && dfs(cur + 1, a - 1, b + 1, c, &ss, &mut ans) {
                ans.push('B');
                true
            } else if 0 < b && dfs(cur + 1, a + 1, b - 1, c, &ss, &mut ans) {
                ans.push('A');
                true
            } else {
                false
            }
        },
        "AC" => {
            if a == 0 && c == 0 {
                false
            } else if 0 < a && dfs(cur + 1, a - 1, b, c + 1, &ss, &mut ans) {
                ans.push('C');
                true
            } else if 0 < c && dfs(cur + 1, a + 1, b, c - 1, &ss, &mut ans) {
                ans.push('A');
                true
            } else {
                false
            }
        },
        "BC" => {
            if b == 0 && c == 0 {
                false
            } else if 0 < b && dfs(cur + 1, a, b - 1, c + 1, &ss, &mut ans) {
                ans.push('C');
                true
            } else if 0 < c && dfs(cur + 1, a, b + 1, c - 1, &ss, &mut ans) {
                ans.push('B');
                true
            } else {
                false
            }
        }
        _ => unreachable!()
    }
}