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(dead_code)]
fn is_whitespace(c: &char) -> bool {
    c.is_whitespace()
}

#[allow(dead_code)]
fn is_eol(c: &char) -> bool {
    ['\r', '\n'].contains(c)
}

#[allow(unused_macros)]
macro_rules! input {
    ($var:ident, $($r:tt)*) => {
        input_inner!{$var, $($r)*}
    };

    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        #[allow(unused_mut, unused_variables, bare_trait_objects)]
        let mut next = move |f: &Fn(&char)->bool| -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|f(&c))
                .take_while(|c|!f(&c))
                .collect()
        };
        input_inner!{next, $($r)*};
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; eol ]) => {
        $next(&is_eol).split(' ').map(|x| x.parse::<$t>().unwrap()).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, parser) => {
        $next
    };

    ($next:expr, $t:ty) => {
        $next(&is_whitespace).parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap, HashSet};

#[allow(dead_code)]
struct Edge {
    from: usize,
    to: usize,
}

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;
#[allow(dead_code)]
const M: usize = 1_000_000_007;

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

    let mut memo = vec![vec![vec![vec![None; 4]; 4]; 4]; n + 1];
    let a = min(3, a);
    let b = min(3, b);
    let c = min(3, c);

    memo[0][a][b][c] = Some((0, 0, 0, 0));
    for i in 0..n {
        for a in 0..4 {
            for b in 0..4 {
                for c in 0..4 {
                    if memo[i][a][b][c].is_none() {
                        continue;
                    }
                    if s[i][0] == 'A' && s[i][1] == 'B' {
                        if a > 0 {
                            memo[i + 1][a - 1][min(3, b + 1)][c] = Some((a, b, c, 1));
                        }
                        if b > 0 {
                            memo[i + 1][min(3, a + 1)][b - 1][c] = Some((a, b, c, 0));
                        }
                    }
                    if s[i][0] == 'B' && s[i][1] == 'C' {
                        if b > 0 {
                            memo[i + 1][a][b - 1][min(3, c + 1)] = Some((a, b, c, 2));
                        }
                        if c > 0 {
                            memo[i + 1][a][min(3, b + 1)][c - 1] = Some((a, b, c, 1));
                        }
                    }
                    if s[i][0] == 'A' && s[i][1] == 'C' {
                        if a > 0 {
                            memo[i + 1][a - 1][b][min(c + 1, 3)] = Some((a, b, c, 2));
                        }
                        if c > 0 {
                            memo[i + 1][min(3, a + 1)][b][c - 1] = Some((a, b, c, 0));
                        }
                    }
                }
            }
        }
    }
    // for i in 0..n + 1 {
    //     for a in 0..4 {
    //         for b in 0..4 {
    //             for c in 0..4 {
    //                 if memo[i][a][b][c].is_some() {
    //                     println!("{} {} {} {}", i, a, b, c);
    //                 }
    //             }
    //         }
    //     }
    // }

    for a in 0..4 {
        for b in 0..4 {
            for c in 0..4 {
                if memo[n][a][b][c].is_some() {
                    println!("Yes");
                    let mut ans = vec![];
                    let mut aa = a;
                    let mut bb = b;
                    let mut cc = c;
                    for i in (1..n + 1).rev() {
                        let x = memo[i][aa][bb][cc].unwrap();
                        ans.push(x.3);
                        aa = x.0;
                        bb = x.1;
                        cc = x.2;
                    }
                    ans.reverse();
                    for i in ans {
                        println!("{}", (b'A' + i as u8) as char);
                    }
                    return;
                }
            }
        }
    }
    println!("No");
}