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)

use proconio::input;

#[allow(unused_imports)]
use proconio::marker::{Bytes, Chars, Usize1};
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
#[allow(unused_imports)]
use std::ops::*;

#[derive(Clone, Debug, Default)]
struct Struct;

/**
 * 現在のa,b,c の値
 * 現在の移動方向 a固定
 * 次の移動方向 next固定
 * bcのどちらに1を足すかを返す
 */
fn f( _a:&mut i32, b:&mut i32, c:&mut i32, next:i32 ) -> u8 {
    if *b == 1 && *c == 1 {
        if next == 2 {
            *b += 1;
            *c -= 1;
            1
        } else {
            *b -= 1;
            *c += 1;
            2
        }
    } else {
        if *b < *c {
            *b += 1;
            *c -= 1;
            1
        } else {
            *b -= 1;
            *c += 1;
            2
        }
    }
}


//#[proconio::fastout]
fn main() {
    input! {
        n: usize,
        mut a: i32,
        mut b: i32,
        mut c: i32,
        s: [String;n],
    }

    let mut v = Vec::with_capacity(n+1);
    for i in 0..n {
        v.push(
            match s[i].as_str() {
                "AB" => 2,
                "BC" => 0,
                "AC" => 1,
                _=>panic!(),
            },
        );
    }

    v.push( 0 );
    let mut ans = Vec::with_capacity(n);
    for i in 0..n {
        //println!("{} {} {} {}", a, b, c, v[i]);
        let r = match v[i] {
            0 => f(&mut a,&mut b,&mut c,v[i+1]),
            1 => f(&mut b,&mut c,&mut a,(v[i+1]+3-1)%3),
            2 => f(&mut c,&mut a,&mut b,(v[i+1]+3-2)%3),
            _ => panic!(),
        };
        if a < 0 || b < 0 || c < 0 {
            println!("No");
            return;
        }
        ans.push(r);
    }
    println!("Yes");
    for i in 0..n {
        println!("{}", match ans[i] {
            0 => "A",
            1 => "B",
            2 => "C",
            _ => panic!(),
        });
    }
}