Problem: 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.

Examples

Input

2 1 3 0
AB
AC


Output

Yes
A
C


Input

3 1 0 0
AB
BC
AB


Output

No


Input

1 0 9 0
AC


Output

No


Input

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB


Output

Yes
C
B
B
C
C
B
A
A

Solution (in JAVA):

Solution:
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;
        }
        long sum = abc[0] + abc[1] + abc[2];
        int[] ans = new int[n];
        if (sum == 0 || (abc[first(s[0])] == 0 && abc[second(s[0])] == 0)) {
            out.println("No");
            return;
        } else if (sum == 2) {
            for (int i = 0; i < n; i++) {
                int first = first(s[i]);
                int second = second(s[i]);
                if (i < n - 1 && abc[first] == 1 && abc[second] == 1) {
                    if (first(s[i + 1]) == first || second(s[i + 1]) == first) {
                        ans[i] = first;
                    } else {
                        ans[i] = second;
                    }
                } else if (abc[first] > abc[second]) {
                    ans[i] = second;
                } else {
                    ans[i] = first;
                }
                if (ans[i] == first) {
                    abc[first]++;
                    abc[second]--;
                } else {
                    abc[second]++;
                    abc[first]--;
                }
            }
        } else {
            for (int i = 0; i < n; i++) {
                int first = first(s[i]);
                int second = second(s[i]);
                if (abc[first] == 0 && abc[second] == 0) {
                    out.println("No");
                    return;
                }
                if (abc[first] > abc[second]) {
                    ans[i] = second;
                } else {
                    ans[i] = first;
                }
                if (ans[i] == first) {
                    abc[first]++;
                    abc[second]--;
                } else {
                    abc[second]++;
                    abc[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();
    }
}