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;

fn main() {
  input!{
    n: usize,
    mut a: i32,
    mut b: i32,
    mut c: i32,
    s: [String; n]
  }
  
  let mut abc: Vec<(u32,u32,u32)> = vec![];
  let mut abc_counter: (u32,u32,u32) = (0,0,0);
  
  for i in 0..n {
    if s[i] == "AB".to_string() {
      abc_counter.0 += 1;
      abc_counter.1 += 1;
    } else if s[i] == "AC".to_string() {
      abc_counter.0 += 1;
      abc_counter.2 += 1;
    } else {
      abc_counter.1 += 1;
      abc_counter.2 += 1;
    }
    abc.push(abc_counter.clone());
  }
  
  let mut ans: Vec<char> = vec![];
  for i in 0..n {
    if s[i] == "AB".to_string() {
      if a < b {
        ans.push('A');
        a += 1;
        b -= 1;
      } else if a > b {
        ans.push('B');
        a -= 1;
        b += 1;
      } else if abc_counter.0 - abc[i].0 > abc_counter.1 - abc[i].1 {
        ans.push('A');
        a += 1;
        b -= 1;
      } else {
        ans.push('B');
        a -= 1;
        b += 1;
      }
    } else if s[i] == "AC".to_string() {
      if a < c {
        ans.push('A');
        a += 1;
        c -= 1;
      } else if a > c {
        ans.push('C');
        a -= 1;
        c += 1;
      } else if abc_counter.0 - abc[i].0 > abc_counter.2 - abc[i].2 {
        ans.push('A');
        a += 1;
        c -= 1;
      } else {
        ans.push('C');
        a -= 1;
        c += 1;
      }
    } else {
      if b < c {
        ans.push('B');
        b += 1;
        c -= 1;
      } else if b > c {
        ans.push('C');
        b -= 1;
        c += 1;
      } else if abc_counter.1 - abc[i].1 > abc_counter.2 - abc[i].2 {
        ans.push('B');
        b += 1;
        c -= 1;
      } else {
        ans.push('C');
        b -= 1;
        c += 1;
      }
    }
    abc.push(abc_counter.clone());
  }
  
  if a >= 0 && b >= 0 && c >= 0 {
    println!("Yes");
    for c in ans {
      println!("{}", c);
    }
  } else {
    println!("No");
  }
}