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: Wrong Answer)

#[allow(unused_imports)]
use proconio::{input, marker::*};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

fn main() {
    input! {
        n: usize,
        a: usize,
        b: usize,
        c: usize,
        s: [String;n],
    }

    macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ z : expr ) ,+ ) => { { std :: cmp :: min ( $ x , min ! ( $ ( $ z ) ,* ) ) } } }
    let a = min!(a, 2);
    let b = min!(b, 2);
    let c = min!(c, 2);

    let mut dp = vec![vec![vec![vec![false; 3]; 3]; 3]; n + 1];

    for i in 0..=a {
        for j in 0..=b {
            for k in 0..=c {
                dp[0][i][j][k] = true;
            }
        }
    }

    for i in 0..n {
        for a in 0..3 {
            for b in 0..3 {
                for c in 0..3 {
                    match s[i].as_str() {
                        "AB" => {
                            if a > 0 {
                                dp[i + 1][a - 1][min!(b + 1, 2)][c] |= dp[i][a][b][c];
                            }
                            if b > 0 {
                                dp[i + 1][min!(a + 1, 2)][b - 1][c] |= dp[i][a][b][c];
                            }
                        }
                        "BC" => {
                            if b > 0 {
                                dp[i + 1][a][b - 1][min!(c + 1, 2)] |= dp[i][a][b][c];
                            }
                            if c > 0 {
                                dp[i + 1][a][min!(b + 1, 2)][c - 1] |= dp[i][a][b][c];
                            }
                        }
                        "AC" => {
                            if a > 0 {
                                dp[i + 1][a - 1][b][min!(c + 1, 2)] |= dp[i][a][b][c];
                            }
                            if c > 0 {
                                dp[i + 1][min!(a + 1, 2)][c][c - 1] |= dp[i][a][b][c];
                            }
                        }
                        _ => (),
                    }
                }
            }
        }
    }

    let mut start = None;
    for a in 0..3 {
        for b in 0..3 {
            for c in 0..3 {
                if dp[n][a][b][c] {
                    start = Some((a, b, c));
                }
            }
        }
    }
    if start.is_none() {
        println!("No");
        return;
    }
    println!("Yes");
    let (mut a, mut b, mut c) = start.unwrap();
    let mut res = Vec::new();
    for i in (0..n).rev() {
        match s[i].as_str() {
            "AB" => {
                if a > 0 && dp[i][a - 1][min!(b + 1, 2)][c] {
                    res.push("A");
                    a -= 1;
                    b += 1;
                } else {
                    res.push("B");
                    a += 1;
                    b -= 1;
                }
                a = min!(a, 2);
                b = min!(b, 2);
            }
            "AC" => {
                if a > 0 && dp[i][a - 1][b][min!(c + 1, 2)] {
                    res.push("A");
                    a -= 1;
                    c += 1;
                } else {
                    res.push("C");
                    a += 1;
                    c -= 1;
                }
                a = min!(a, 2);
                c = min!(c, 2);
            }
            "BC" => {
                if c > 0 && dp[i][a][min!(b + 1, 2)][c - 1] {
                    res.push("C");
                    c -= 1;
                    b += 1;
                } else {
                    res.push("B");
                    c += 1;
                    b -= 1;
                }
                b = min!(b, 2);
                c = min!(c, 2);
            }
            _ => (),
        }
    }

    for e in res.into_iter().rev() {
        println!("{}", e);
    }
}