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 proconio::input;
#[allow(unused_imports)]
use proconio::marker::*;
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
#[allow(unused_imports)]
use std::f64::consts::*;

#[allow(unused)]
const INF: usize = std::usize::MAX / 4;
#[allow(unused)]
const M: usize = 1000000007;

fn index(a: usize, b: usize, c: usize) -> usize {
    a * 9 + b * 3 + c
}

fn abc(i: usize) -> (usize, usize, usize) {
    (i / 9, i % 9 / 3, i % 3)
}

fn main() {
    input! {
        n: usize,
        mut a: usize,
        mut b: usize,
        mut c: usize,
        s: [String; n],
    }
    let mut states = vec![vec![None; 27]; n + 1];
    states[0][index(min(2, a), min(2, b), min(2, c))] = Some((' ', INF));
    for i in 1..=n {
        let mut available = false;
        for j in 0..27 {
            if let Some(_) = states[i - 1][j] {
                let (aj, bj, cj) = abc(j);
                if &*s[i - 1] == "AB" {
                    if bj > 0 {
                        states[i][index(min(2, aj + 1), bj - 1, cj)] = Some(('A', j));
                        available = true;
                    }
                    if aj > 0 {
                        states[i][index(aj - 1, min(2, bj + 1), cj)] = Some(('B', j));
                        available = true;
                    }
                }
                if &*s[i - 1] == "AC" {
                    if cj > 0 {
                        states[i][index(min(2, aj + 1), bj, cj - 1)] = Some(('A', j));
                        available = true;
                    }
                    if aj > 0 {
                        states[i][index(aj - 1, bj, min(2, cj + 1))] = Some(('C', j));
                        available = true;
                    }
                }
                if &*s[i - 1] == "BC" {
                    if cj > 0 {
                        states[i][index(aj, min(2, bj + 1), cj - 1)] = Some(('B', j));
                        available = true;
                    }
                    if bj > 0 {
                        states[i][index(aj, bj - 1, min(2, cj + 1))] = Some(('C', j));
                        available = true;
                    }
                }
            }
        }
        if !available {
            println!("No");
            return;
        }
    }

    println!("Yes");
    let (d, mut j) = states[n]
        .iter()
        .filter(|o| o.is_some())
        .nth(0)
        .unwrap()
        .unwrap();
    let mut sol = vec![d];
    for i in (1..n).rev() {
        let (e, k) = states[i][j].unwrap();
        sol.push(e);
        j = k;
    }
    sol.reverse();
    for i in 0..n {
        let d = sol[i];
        // if &*s[i] == "AB" {
        //     if d == 'A' {
        //         a += 1;
        //         b -= 1;
        //     } else {
        //         a -= 1;
        //         b += 1;
        //     }
        // }
        // if &*s[i] == "AC" {
        //     if d == 'A' {
        //         a += 1;
        //         c -= 1;
        //     } else {
        //         a -= 1;
        //         c += 1;
        //     }
        // }
        // if &*s[i] == "BC" {
        //     if d == 'B' {
        //         b += 1;
        //         c -= 1;
        //     } else {
        //         b -= 1;
        //         c += 1;
        //     }
        // }
        // eprintln!("{} {} {}", a, b, c);
        println!("{}", d);
    }
}