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::Read;
use std::cmp::min;

fn main() {
    let mut line = String::new();
    std::io::stdin().read_to_string(&mut line).unwrap();
    let mut it = line.split_whitespace();
    let n: usize = it.next().unwrap().parse().unwrap();
    let mut a: usize = it.next().unwrap().parse().unwrap();
    let mut b: usize = it.next().unwrap().parse().unwrap();
    let mut c: usize = it.next().unwrap().parse().unwrap();
    let s: Vec<i32> = it.map(|a| match (a) {
        "AB" => 1,
        "BC" => 2,
        _ => 3,
    }).collect();

    a = min(a, 9);
    b = min(b, 9);
    c = min(c, 9);
    let sum = a + b + c;
    let orig_a = a;
    let orig_b = b;

    let mut dp = vec![vec![vec![0; (sum + 1)]; (sum + 1)]; n + 1];
    dp[0][a][b] = 1;
    for i in 0..n {
        for a in 0..=sum {
            for b in 0..=sum {
                if dp[i][a][b] == 0 {
                    continue;
                }
                let c = sum - a - b;
                if s[i] == 1 {
                    if a > 0 {
                        dp[i + 1][a - 1][b + 1] = 2;
                    }
                    if b > 0 {
                        dp[i + 1][a + 1][b - 1] = 1;
                    }
                } else if s[i] == 2 {
                    if b > 0 {
                        dp[i + 1][a][b - 1] = 3;
                    }
                    if c > 0 {
                        dp[i + 1][a][b + 1] = 2;
                    }
                } else {
                    if c > 0 {
                        dp[i + 1][a + 1][b] = 1;
                    }
                    if a > 0 {
                        dp[i + 1][a - 1][b] = 3;
                    }
                }
            }
        }
    }

    for a in 0..=sum {
        for b in 0..=sum {
            if dp[n][a][b] != 0 {
                println!("Yes");
                let mut cur_a = a;
                let mut cur_b = b;
                let mut cur_n = n;
                let mut ans = vec![0; n];
                for i in 0..n {
                    ans[cur_n - 1] = dp[cur_n][cur_a][cur_b];
                    if s[cur_n - 1] == 1 {
                        if dp[cur_n][cur_a][cur_b] == 1 {
                            cur_a -= 1;
                            cur_b += 1;
                        } else {
                            cur_a += 1;
                            cur_b -= 1;
                        }
                    } else if s[cur_n - 1] == 2 {
                        if dp[cur_n][cur_a][cur_b] == 2 {
                            cur_b -= 1;
                        } else {
                            cur_b += 1;
                        }
                    } else {
                        if dp[cur_n][cur_a][cur_b] == 3 {
                            cur_a += 1;
                        } else {
                            cur_a -= 1;
                        }
                    }
                    cur_n -= 1;
                }
                for a in &ans {
                    match(a) {
                        1 => println!("A"),
                        2 => println!("B"),
                        _ => println!("C"),
                    }
                }
                assert_eq!(cur_a, orig_a);
                assert_eq!(cur_b, orig_b);
                return;
            }
        }
    }
    println!("No");
}