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)

#![allow(unused_imports)]
use std::cmp;
use std::collections::*;

pub struct Scanner {
    line: Vec<String>,
    idx: usize,
}

#[allow(dead_code)]
impl Scanner {
    fn new() -> Scanner {
        return Scanner {
            line: vec![],
            idx: 0,
        };
    }
    fn next<T: std::str::FromStr>(&mut self) -> T {
        if self.idx == self.line.len() {
            let mut buffer = String::new();
            std::io::stdin().read_line(&mut buffer).ok();
            let a: Vec<&str> = buffer.trim().split(' ').collect();
            self.line = a.iter().map(|&s| String::from(s)).collect();
            self.idx = 0;
        }
        let ret: T = self.line[self.idx].parse::<T>().ok().expect("Parse error.");
        self.idx += 1;
        ret
    }
    fn next_string(&mut self) -> Vec<char> {
        let s: String = self.next();
        return s.chars().collect::<Vec<char>>();
    }
    fn next_vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        let mut v: Vec<T> = Vec::with_capacity(n);
        for _i in 0..n {
            v.push(self.next());
        }
        v
    }
}

fn f(n: usize, a: i32, b: i32, c: i32, ab: i32, ac: i32, bc: i32) -> bool {
    let da = cmp::min(a, ab + ac);
    let db = cmp::min(b, ab + bc);
    let dc = cmp::min(c, ac + bc);
    //println!("{} {} {}", da,db,dc);
    return n as i32 <= da + db + dc;
}

fn main() {
    let mut scan = Scanner::new();
    let n: usize = scan.next();
    let mut a: i32 = scan.next();
    let mut b: i32 = scan.next();
    let mut c: i32 = scan.next();
    let s: Vec<String> = scan.next_vec(n);

    let mut ab: i32 = 0;
    let mut ac: i32 = 0;
    let mut bc: i32 = 0;
    let mut ok = true;

    for i in 0..n {
        if s[i] == "AA" {
            ab += 1;
        }else if s[i] == "AC"{
            ac += 1;
        }else {
            bc += 1;
        }
        if !f(i + 1, a,b,c,ab,ac,bc){
            ok=false;
            break;
        }
    }

    if ok {
        let mut ans: Vec<char> = Vec::new();
        println!("Yes");
        for i in (0..n).rev() {
            if s[i] == "AB" {
                ab -= 1;
                if f(i, a-1,b+1,c,ab,ac,bc){
                    ans.push('B');
                    a -= 1;
                    b += 1;
                }else{
                    ans.push('A');
                    a += 1;
                    b -= 1;
                }
            }else if s[i] == "AC"{
                ac -= 1;
                if f(i, a-1,b,c+1,ab,ac,bc){
                    ans.push('C');
                    a -= 1;
                    c += 1;
                }else{
                    ans.push('A');
                    a += 1;
                    c -= 1;
                }
            }else {
                bc -= 1;
                if f(i, a,b-1,c+1,ab,ac,bc){
                    ans.push('B');
                    b -= 1;
                    c += 1;
                }else{
                    ans.push('B');
                    b += 1;
                    c -= 1;
                }
            }
        }
        for i in (0..n).rev() {
            println!("{}", ans[i]);
        }
    }else{
        println!("No");
    }
}