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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class Main {
    static In in = new In();
    static Out out = new Out();
    static final long mod = 1000000007;
    static final long inf = 0x1fffffffffffffffL;
    static final int iinf = 0x3fffffff;
    static final int[] da = {-1, 0, 1, 0, -1, 1, 1, -1, -1};

    long[] abc;
    void solve() {
        int n = in.nextInt();
        abc = new long[] {in.nextLong(), in.nextLong(), in.nextLong()};
        int[] s = new int[n];
        for (int i = 0; i < n; i++) {
            String o = in.next();
            s[i] = o.equals("AB") ? 0 : o.equals("AC") ? 1 : 2;
        }
        int[] d = {0, 0, 0};
        int[] ans = new int[n];
        int point = 0;
        for (int i = 0; i < n; i++) {
            int first = s[i] == 2 ? 1 : 0;
            int second = s[i] == 0 ? 1 : 2;
            if ((abc[first] == 0 && abc[second] == 0) && (d[first] == -1 || d[second] == -1)) {
                for (int j = point; j < i; j++) {
                    ans[j] = ans[j] == first(s[j]) ? second(s[j]) : first(s[j]);
                }
                for (int j = 0; j < 3; j++) {
                    d[j] *= -1;
                }
            }
            if (abc[first] == 0 && abc[second] == 0) {
                out.println("No");
                return;
            } else if (abc[first] == 0) {
                abc[first]++;
                abc[second]--;
                d[first]++;
                d[second]--;
                ans[i] = first;
            } else if (abc[second] == 0) {
                abc[second]++;
                abc[first]--;
                d[second]++;
                d[first]--;
                ans[i] = second;
            } else {
                if (d[first] == -1) {
                    ans[i] = first;
                } else if (d[second] == -1) {
                    ans[i] = second;
                } else if (d[first] == 1) {
                    ans[i] = second;
                } else if (d[second] == 1) {
                    ans[i] = first;
                } else {
                    point = i;
                    ans[i] = first;
                }
                if (ans[i] == first) {
                    abc[first]++;
                    abc[second]--;
                    d[first]++;
                    d[second]--;
                } else {
                    abc[second]++;
                    abc[first]--;
                    d[second]++;
                    d[first]--;
                }
            }
        }
        out.println("Yes");
        for (int i = 0; i < n; i++) {
            out.println("ABC".charAt(ans[i]));
        }
    }

    int first(int s) {
        return s == 2 ? 1 : 0;
    }

    int second(int s) {
        return s == 0 ? 1 : 2;
    }

    int[] g(int a, int b) {
        int[] ans = new int[2];
        if (a == 0) {
            ans[0] = b == 1 ? 0 : 1;
            ans[1] = b == 1 ? 2 : 2;
        } else if (a == 1) {
            ans[0] = b == 0 ? 0 : 2;
            ans[1] = b == 0 ? 1 : 1;
        } else {
            ans[0] = b == 0 ? 1 : 2;
            ans[1] = b == 0 ? 0 : 0;
        }
        return ans;
    }

    int f(int a, int b) {
        return 3 - a - b;
    }

    public static void main(String[]$) {
        new Main().solve();
        out.flush();
    }
}

class In {
    private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
    private StringTokenizer tokenizer;

    String next() {
        try {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (IOException ignored) {
        }
        return tokenizer.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    char[][] nextCharArray(int n, int m) {
        char[][] a = new char[n][m];
        for (int i = 0; i < n; i++) {
            a[i] = next().toCharArray();
        }
        return a;
    }

    int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = nextInt();
        }
        return a;
    }

    int[] nextIntArray(int n, IntUnaryOperator op) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = op.applyAsInt(nextInt());
        }
        return a;
    }

    long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = nextLong();
        }
        return a;
    }

    long[] nextLongArray(int n, LongUnaryOperator op) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = op.applyAsLong(nextLong());
        }
        return a;
    }
}

class Out {
    private PrintWriter out = new PrintWriter(System.out);
    boolean autoFlush = false;

    void println(Object... a) {
        StringJoiner joiner = new StringJoiner(" ");
        for (Object obj : a) {
            joiner.add(String.valueOf(obj));
        }
        out.println(joiner);
        if (autoFlush) {
            out.flush();
        }
    }

    void println(int[] a) {
        StringJoiner joiner = new StringJoiner(" ");
        for (int i : a) {
            joiner.add(Integer.toString(i));
        }
        out.println(joiner);
        if (autoFlush) {
            out.flush();
        }
    }

    void println(long[] a) {
        StringJoiner joiner = new StringJoiner(" ");
        for (long i : a) {
            joiner.add(Long.toString(i));
        }
        out.println(joiner);
        if (autoFlush) {
            out.flush();
        }
    }

    void flush() {
        out.flush();
    }
}