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;
use std::str::FromStr;

fn input_tuple() -> (u64, u64, u64, u64) {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    let vec: Vec<u64> = line.split_whitespace().map(|s| s.parse().unwrap()).collect();
    (vec[0], vec[1], vec[2], vec[3])
}

fn input_char_vec() -> Vec<char> {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    line.trim().chars().collect()
}

fn main() {
    let (n, mut a, mut b, mut c) = input_tuple();
    let mut ans: Vec<char> = Vec::new();
    let mut queries: Vec<Vec<char>> = Vec::new();
    for _ in 0..n {
        let s = input_char_vec();
        queries.push(s);
    }
    for i in 0..n as usize {
        // println!("{:?}", ans);
        if queries[i][0] == 'A' && queries[i][1] == 'B' {
            if a == 0 && b == 0 {
                println!("No");
                return;
            }
            if a == 1 && b == 1 && i != n as usize - 1 {
                if queries[i+1][0] == 'A' && queries[i+1][1] == 'B' {
                    a -= 1;
                    b += 1;
                    ans.push('B');
                } else if queries[i+1][0] == 'A' && queries[i+1][1] == 'C' {
                    b -= 1;
                    a += 1;
                    ans.push('A');
                } else {
                    b += 1;
                    a -= 1;
                    ans.push('B');
                }
            } else if a > b {
                a -= 1;
                b += 1;
                ans.push('B');
            } else {
                b -= 1;
                a += 1;
                ans.push('A');
            }
        }
        if queries[i][0] == 'A' && queries[i][1] == 'C' {
            if a == 0 && c == 0 {
                println!("No");
                return;
            }
            if a == 1 && c == 1 && i != n as usize - 1 {
                if queries[i+1][0] == 'A' && queries[i+1][1] == 'B' {
                    c -= 1;
                    a += 1;
                    ans.push('A');
                } else if queries[i+1][0] == 'A' && queries[i+1][1] == 'C' {
                    c -= 1;
                    a += 1;
                    ans.push('A');
                } else {
                    c += 1;
                    a -= 1;
                    ans.push('C');
                }
            } else if a > c {
                a -= 1;
                c += 1;
                ans.push('C');
            } else {
                c -= 1;
                a += 1;
                ans.push('A');
            }
        }
        if queries[i][0] == 'B' && queries[i][1] == 'C' {
            if c == 0 && b == 0 {
                println!("No");
                return;
            }
            if b == 1 && c == 1 && i != n as usize - 1 {
                if queries[i+1][0] == 'A' && queries[i+1][1] == 'B' {
                    c -= 1;
                    b += 1;
                    ans.push('B');
                } else if queries[i+1][0] == 'A' && queries[i+1][1] == 'C' {
                    c += 1;
                    b -= 1;
                    ans.push('C');
                } else {
                    c += 1;
                    b -= 1;
                    ans.push('C');
                }
            } else if b > c {
                b -= 1;
                c += 1;
                ans.push('C');
            } else {
                c -= 1;
                b += 1;
                ans.push('B');
            }
        }
    }
    println!("Yes");
    for a in ans {
        println!("{}", a);
    }
}