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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        final int INF = -(int) 1e6;
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int sum = 0;
        int[] ABC = new int[3];
        for (int i = 0; i < 3; i++) {
            ABC[i] = sc.nextInt();
            sum += ABC[i];
        }
        //選ばれてないもの(A=0, B=1, C=2)が入る
        int[] s = new int[N];
        for (int i = 0; i < N; i++) {
            String str = sc.next();
            switch (str) {
                case "AB":
                    s[i] = 2;
                    break;
                case "BC":
                    s[i] = 0;
                    break;
                case "AC":
                    s[i] = 1;
                    break;
            }
        }

        if (sum == 0) {
            System.out.println("No");
        } else if (sum == 1) {
            StringBuilder strb = new StringBuilder("Yes\n");
            boolean possible = true;
            for (int i = 0; i < N; i++) {
                int x = next(s[i]);
                int y = next(x);
                if (ABC[s[i]] == 1) {
                    possible = false;
                } else {
                    ABC[x] = 1 - ABC[x];
                    ABC[y] = 1 - ABC[y];
                    strb.append((ABC[x] == 0) ? "ABC".charAt(x) : "ABC".charAt(y));
                    strb.append("\n");
                }
            }
            if (possible) {
                System.out.println(strb.toString());
            } else {
                System.out.println("No");
            }
        } else if (ABC[next(s[0])] == 0 && ABC[next(next(s[0]))] == 0) {
            System.out.println("No");
        } else {
            StringBuilder strb = new StringBuilder("Yes\n");
            for (int i = 0; i < N; i++) {
                int x = next(s[i]);
                int y = next(x);
                int choice = 0;
                if (i < N-1 && ABC[x] == 1 && ABC[y] == 1) {
                    if (s[i + 1] == x) {
                        ABC[x]--;
                        ABC[y]++;
                        choice = y;
                    } else {
                        ABC[x]++;
                        ABC[y]--;
                        choice = x;
                    }
                } else {
                    if (ABC[x] > ABC[y]) {
                        ABC[x]--;
                        ABC[y]++;
                        choice = y;
                    } else {
                        ABC[x]++;
                        ABC[y]--;
                        choice = x;
                    }
                }
                strb.append("ABC".charAt(choice));
                strb.append("\n");
            }
            System.out.println(strb.toString());
        }
    }

    private static int next(int x) {
        return (x + 1) % 3;
    }

    private static boolean isAllNonNegative(int[] vals) {
        boolean result = true;
        for (int val : vals) {
            if (val < 0) {
                result = false;
            }
        }
        return result;
    }
}