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)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
fn main() {
    proconio::input! {
        n: usize, a: usize, b: usize, c: usize,
        s: [String; n]
    }
    let mut ok = vec![vec![vec![vec![true; 3]; 3]; 3]; n + 1];
    for i in (0..n).rev() {
        for a in 0..3 {
            for b in 0..3 {
                for c in 0..3 {
                    ok[i][a][b][c] = if s[i] == "AB" {
                        (a > 0 && ok[i + 1][a - 1][std::cmp::min(b + 1, 2)][c])
                            || (b > 0
                                && ok[i + 1][std::cmp::min(a + 1, 2)][b - 1][c])
                    } else if s[i] == "BC" {
                        (b > 0 && ok[i + 1][a][b - 1][std::cmp::min(c + 1, 2)])
                            || (c > 0
                                && ok[i + 1][a][std::cmp::min(b + 1, 2)][c - 1])
                    } else {
                        (a > 0 && ok[i + 1][a - 1][b][std::cmp::min(c + 1, 2)])
                            || (c > 0
                                && ok[i + 1][std::cmp::min(a + 1, 2)][b][c - 1])
                    };
                }
            }
        }
    }
    let mut a = std::cmp::min(a, 2);
    let mut b = std::cmp::min(b, 2);
    let mut c = std::cmp::min(c, 2);
    if !ok[0][a][b][c] {
        println!("No");
        return;
    }
    println!("Yes");
    for i in 0..n {
        if s[i] == "AB" {
            if a > 0 && ok[i + 1][a - 1][std::cmp::min(b + 1, 2)][c] {
                a -= 1;
                b = std::cmp::min(b + 1, 2);
                println!("B");
            } else if b > 0 && ok[i + 1][std::cmp::min(a + 1, 2)][b - 1][c] {
                b -= 1;
                a = std::cmp::min(a + 1, 2);
                println!("A");
            }
        }
        if s[i] == "AC" {
            if a > 0 && ok[i + 1][a - 1][b][std::cmp::min(c + 1, 2)] {
                a -= 1;
                c = std::cmp::min(c + 1, 2);
                println!("C");
            } else if c > 0 && ok[i + 1][std::cmp::min(a + 1, 2)][b][c - 1] {
                c -= 1;
                a = std::cmp::min(a + 1, 2);
                println!("A");
            }
        }
        if s[i] == "BC" {
            if c > 0 && ok[i + 1][a][std::cmp::min(b + 1, 2)][c - 1] {
                c -= 1;
                b = std::cmp::min(b + 1, 2);
                println!("B");
            } else if b > 0 && ok[i + 1][a][b - 1][std::cmp::min(c + 1, 2)] {
                b -= 1;
                c = std::cmp::min(c + 1, 2);
                println!("C");
            }
        }
    }
}
*/

fn main() {
    let exe = "/tmp/bin16FC4523";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";