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: Wrong Answer)

//! Framework <https://github.com/vain0x/procon>

#![allow(non_snake_case)]
#![allow(unused_imports)]

use std::collections::*;

pub struct Scan(Box<dyn Iterator<Item = &'static str>>); // '

impl Scan {
    fn new() -> Self {
        let mut buf = String::new();
        let read_line = move || {
            std::io::stdin().read_line(&mut buf).unwrap();
            Box::leak(buf.split_off(0).into_boxed_str()).split_whitespace()
        };
        Scan(Box::new(std::iter::repeat_with(read_line).flatten()))
    }

    pub fn word<T: std::str::FromStr>(&mut self) -> T {
        self.0.next().unwrap().parse().ok().unwrap()
    }

    pub fn list<T: std::str::FromStr>(&mut self, len: usize) -> Vec<T> {
        std::iter::repeat_with(|| self.word()).take(len).collect()
    }
}

fn main() {
    let mut scan = Scan::new();

    let N = scan.word::<usize>();
    let A = scan.word::<i64>();
    let B = scan.word::<i64>();
    let C = scan.word::<i64>();
    let s = scan.list::<String>(N);

    let mut vars = vec![0; N];
    let mut states = vec![(0, 0, 0); N];
    let mut ok = true;

    {
        for i in 0..N {
            match s[i].as_str() {
                "AB" => {
                    vars[i] = 1;
                }
                "AC" => {
                    vars[i] = 2;
                }
                "BC" => {
                    vars[i] = 2;
                }
                _ => unreachable!(),
            }
        }
    }

    // calc states
    {
        let (mut a, mut b, mut c) = (A, B, C);

        for i in 0..N {
            match (s[i].as_str(), vars[i]) {
                ("AB", 0) => {
                    a += 1;
                    b -= 1;
                }
                ("AB", 1) => {
                    a -= 1;
                    b += 1;
                }
                ("AC", 0) => {
                    a += 1;
                    c -= 1;
                }
                ("AC", 2) => {
                    a -= 1;
                    c += 1;
                }
                ("BC", 1) => {
                    b += 1;
                    c -= 1;
                }
                ("BC", 2) => {
                    b -= 1;
                    c += 1;
                }
                _ => unreachable!(),
            }

            states[i] = (a, b, c);
        }
    }

    // c -> b
    {
        let mut c = states[N - 1].2;
        for i in (0..N).rev() {
            if s[i] == "BC" && c >= 1 {
                vars[i] = 1;
                c -= 1;
                if c == 0 {
                    break;
                }
            }
        }
    }

    // calc states
    {
        let (mut a, mut b, mut c) = (A, B, C);

        for i in 0..N {
            match (s[i].as_str(), vars[i]) {
                ("AB", 0) => {
                    a += 1;
                    b -= 1;
                }
                ("AB", 1) => {
                    a -= 1;
                    b += 1;
                }
                ("AC", 0) => {
                    a += 1;
                    c -= 1;
                }
                ("AC", 2) => {
                    a -= 1;
                    c += 1;
                }
                ("BC", 1) => {
                    b += 1;
                    c -= 1;
                }
                ("BC", 2) => {
                    b -= 1;
                    c += 1;
                }
                _ => unreachable!(),
            }

            states[i] = (a, b, c);
        }
    }

    // c -> a, b -> a
    {
        let mut b = states[N - 1].1;
        let mut c = states[N - 1].2;

        for i in (0..N).rev() {
            if s[i] == "AC" && c >= 1 {
                vars[i] = 0;
                c -= 1;
            }
            if s[i] == "AB" && b >= 1 {
                vars[i] = 0;
                b -= 1;
            }

            if b == 0 && c == 0 {
                break;
            }
        }
    }

    // calc states
    {
        let (mut a, mut b, mut c) = (A, B, C);

        for i in 0..N {
            match (s[i].as_str(), vars[i]) {
                ("AB", 0) => {
                    a += 1;
                    b -= 1;
                }
                ("AB", 1) => {
                    a -= 1;
                    b += 1;
                }
                ("AC", 0) => {
                    a += 1;
                    c -= 1;
                }
                ("AC", 2) => {
                    a -= 1;
                    c += 1;
                }
                ("BC", 1) => {
                    b += 1;
                    c -= 1;
                }
                ("BC", 2) => {
                    b -= 1;
                    c += 1;
                }
                _ => unreachable!(),
            }

            states[i] = (a, b, c);
            ok = a >= 0 && b >= 0 && c >= 0;
        }
    }

    if !ok {
        println!("No");
    } else {
        println!("Yes");
        for i in 0..N {
            println!(
                "{}",
                match vars[i] {
                    0 => "A",
                    1 => "B",
                    2 => "C",
                    _ => unreachable!(),
                }
            );
        }
    }
}