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_imports)]
use proconio::{input, marker::Chars};

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

    let mut pattern = vec![];

    let mut abc = vec![a, b, c];
    let sum = a + b + c;

    if sum == 0 {
        println!("No");
        return;
    }

    fn run(large: usize, small: usize, abc: &mut Vec<isize>, pattern: &mut Vec<String>) {
        abc[large] -= 1;
        abc[small] += 1;
        let st = match small {
            0 => "A",
            1 => "B",
            _ => "C",
        };
        pattern.push(st.to_string());
    }

    fn phase(
        pattern: &mut Vec<String>,
        abc: &mut Vec<isize>,
        ope: &str,
        next_ope: Option<&String>,
    ) {
        let (one, another, _theother) = match ope {
            "AB" => (0, 1, 2),
            "BC" => (1, 2, 0),
            _ => (2, 0, 1), // "AC"
        };

        if abc[one] == 0 || abc[another] == 0 {
            if abc[one] > abc[another] {
                run(one, another, abc, pattern);
            } else {
                run(another, one, abc, pattern);
            }
            return;
        }

        if let Some(n) = next_ope {
            // 先読み
            if n == "AB" {
                if one == 1 {
                    // 今が BC で次が AB なら B に 1 足す
                    run(another, one, abc, pattern);
                } else {
                    // 今が AC, AB で次が AB なら A に 1 足す
                    run(one, another, abc, pattern);
                }
            } else if n == "BC" {
                if one == 2 {
                    run(another, one, abc, pattern);
                } else {
                    run(one, another, abc, pattern);
                }
            } else {
                // "AC"
                if one == 0 {
                    run(another, one, abc, pattern);
                } else {
                    run(one, another, abc, pattern);
                }
            }

            return;
        }

        // どちらでも同じ
        run(one, another, abc, pattern);
    }

    for i in 0..n {
        phase(&mut pattern, &mut abc, &ss[i], ss.get(i + 1));

        if abc[0] < 0 || abc[1] < 0 || abc[2] < 0 {
            println!("No");
            return;
        }
    }

    println!("Yes");
    for e in &pattern {
        println!("{}", e);
    }
}