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::marker::Bytes;
use proconio::{fastout, input};
use std::collections::HashMap;

#[fastout]
fn main() {
    input! {
        n: usize,
        mut w: [i32; 3],
        s: [Bytes; n],
    }

    for i in 0..3 {
        w[i] = w[i].min(2);
    }
    let w = [w[0], w[1], w[2]];
    let mut dp: Vec<HashMap<[i32; 3], i32>> = Vec::new();
    let mut h: HashMap<[i32; 3], i32> = HashMap::new();
    h.insert(w, -1);
    dp.push(h);

    let mut x: HashMap<Vec<u8>, Vec<usize>> = HashMap::new();
    x.insert("AB".as_bytes().to_vec(), vec![0, 1]);
    x.insert("AC".as_bytes().to_vec(), vec![0, 2]);
    x.insert("BC".as_bytes().to_vec(), vec![1, 2]);
    for i in 0..n {
        let mut h: HashMap<[i32; 3], i32> = HashMap::new();
        let y = &x[&s[i]];
        for (v, _) in &dp[i] {
            let mut v_ = *v;
            v_[y[0]] += 1;
            v_[y[1]] -= 1;
            if v_[y[1]] >= 0 {
                h.insert(v_, 0);
            }
            let mut v_ = *v;
            v_[y[0]] -= 1;
            v_[y[1]] += 1;
            if v_[y[0]] >= 0 {
                h.insert(v_, 1);
            }
        }

        dp.push(h);
    }

    if dp[n].is_empty() {
        println!("No");
        return;
    }
    for (k, _) in &dp[n] {
        let mut ans: Vec<usize> = Vec::new();
        let mut k = *k;
        for i in 0..n {
            let j = n - 1 - i;
            let p = dp[j + 1].get(&k).unwrap();
            let p = *p as usize;
            ans.push(p);
            let y = &x[&s[j]];
            k[y[p]] -= 1;
            k[y[p ^ 1]] += 1;
        }

        println!("Yes");
        ans.reverse();
        for i in 0..n {
            println!("{}", s[i][ans[i]] as char);
        }
        break;
    }
}