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)

#[warn(unused_imports)]
use proconio::{
   fastout, input,
   marker::{Bytes, Chars, Isize1, Usize1},
};

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

   if a + b + c == 0 {
      println!("No");
      return;
   }

   if a + b + c == 1 {
      let mut ans = vec![0; n];
      for (i, s) in s.iter().enumerate() {
         if s == "AB" {
            if a == 0 && b == 0 {
               println!("No");
               return;
            }
            if a > b {
               ans[i] = 1;
               a -= 1;
               b += 1;
            } else {
               ans[i] = 0;
               a += 1;
               b -= 1;
            }
         }
         if s == "BC" {
            if c == 0 && b == 0 {
               println!("No");
               return;
            }
            if b > c {
               ans[i] = 2;
               b -= 1;
               c += 1;
            } else {
               ans[i] = 1;
               b += 1;
               c -= 1;
            }
         }
         if s == "AC" {
            if a == 0 && c == 0 {
               println!("No");
               return;
            }
            if a > c {
               ans[i] = 2;
               a -= 1;
               c += 1;
            } else {
               ans[i] = 0;
               a += 1;
               c -= 1;
            }
         }
      }
      println!("Yes");
      for a in ans {
         if a == 0 {
            println!("A");
         } else if a == 1 {
            println!("B");
         } else {
            println!("C");
         }
      }
      return;
   }

   if a * b + b * c + c * a == 0 {
      if s[0] == "AB" && c != 0 {
         println!("No");
         return;
      }
      if s[0] == "BC" && a != 0 {
         println!("No");
         return;
      }
      if s[0] == "AC" && b != 0 {
         println!("No");
         return;
      }
   }

   let mut ans = vec![0; n];
   for i in 0..n {
      if s[i] == "AB" {
         if b == 0 {
            ans[i] = 1;
            a -= 1;
            b += 1;
         } else if a == 0 {
            ans[i] = 0;
            a += 1;
            b -= 1;
         } else {
            if i == n - 1 || s[i + 1] == "AB" {
               ans[i] = 0;
               a += 1;
               b -= 1;
            } else {
               if s[i + 1] == "BC" {
                  ans[i] = 1;
                  a -= 1;
                  b += 1;
               } else {
                  ans[i] = 0;
                  a += 1;
                  b -= 1;
               }
            }
         }
      }
      if s[i] == "BC" {
         if b == 0 {
            ans[i] = 1;
            c -= 1;
            b += 1;
         } else if c == 0 {
            ans[i] = 2;
            c += 1;
            b -= 1;
         } else {
            if i == n - 1 || s[i + 1] == "BC" {
               ans[i] = 2;
               c += 1;
               b -= 1;
            } else {
               if s[i + 1] == "AB" {
                  ans[i] = 1;
                  c -= 1;
                  b += 1;
               } else {
                  ans[i] = 2;
                  c += 1;
                  b -= 1;
               }
            }
         }
      }
      if s[i] == "AC" {
         if c == 0 {
            ans[i] = 2;
            a -= 1;
            c += 1;
         } else if a == 0 {
            ans[i] = 0;
            a += 1;
            c -= 1;
         } else if a > 0 && c > 0 {
            if i == n - 1 || s[i + 1] == "AC" {
               ans[i] = 0;
               a += 1;
               c -= 1;
            } else {
               if s[i + 1] == "BC" {
                  ans[i] = 2;
                  a -= 1;
                  c += 1;
               } else {
                  ans[i] = 0;
                  a += 1;
                  c -= 1;
               }
            }
         }
      }
   }
   println!("Yes");
   for a in ans {
      if a == 0 {
         println!("A");
      } else if a == 1 {
         println!("B");
      } else {
         println!("C");
      }
   }
}