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)]
#![allow(non_snake_case)]
use proconio::*;
use std::io::Read;
use std::io::{stdout, BufWriter, Write};
use std::cmp::min;
 
fn main() {
    input! {
        n: usize,
      	a: usize,
      	b: usize,
       	c: usize,
        s: [String; n],
    }
    
  	let mut item : [usize; 3] = [a, b, c];
  	//println!("INIT : {:?}", item);
  	let s : Vec<[usize; 2]> = s.iter().map(|i| {
    	let i = i.as_bytes();
      	let first = match i[0] {
          	b'A' => 0,
          	b'B' => 1,
          	_ => 2,
      	};
      	let second = match i[1] {
          	b'A' => 0,
          	b'B' => 1,
          	_ => 2,
      	};
      	[first, second]
    }).collect();
  
  	//println!("{:?}", item);
  	//println!("{:?}", s);
  	
    // dfsで探索する
  	let mut ind = 0;
  	let mut v = vec![0; n]; // flag
  	loop {
      	// v[ind] == 0 or 1
      	// item[s[ind][v[ind]]]
      	if ind == n {
          	// finish
          	println!("Yes");
          	break;
      	}
      	
      	// println!("{} : {}", ind, v[ind]);
      	match v[ind] {
          	0 => {
              	// 引けない場合は,v[ind] = 1にいく
              	if item[s[ind][1]] == 0 {
                  	v[ind] = 1;
                  	continue;
              	} else {
                  	//println!("{}: Select {}",ind, 0);
                  	item[s[ind][0]] += 1;
                  	item[s[ind][1]] -= 1;
                  	//println!("{:?}", item);
              		ind += 1;
              		continue;
              	}
          	}
          	1 => {
              	// 引けない場合は，一つ前に戻る
              	if item[s[ind][0]] == 0 {
                  	if ind == 0 { println!("No"); break; }
                  	v[ind] = 0;
                  	ind -= 1;
                  	continue;
              	} else {
                  	//println!("{}: Select {}",ind, 1);
                  	item[s[ind][1]] += 1;
                  	item[s[ind][0]] -= 1;
                  	//println!("{:?}", item);
              		ind += 1;
              		continue;
              	}
          	}
          	_ => { // panic!
              	//unreachable!();
              	println!("INVALID STATE:{}", ind);
              	break;
          	}
      	}
  	}
    
  	if ind == n {
      	let map = ['A', 'B', 'C'];
      	for i in 0..n {
          	println!("{}", map[s[i][v[i]]]);
      	}
  	}
}