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.util.Scanner;
import java.util.HashMap;

public class Main {
    private static final int MAXN = 2 * (int)10e5, MAXA = (int)10e9;
    private static int[] data = new int[3];
    private final static String[] str = {"A", "B", "C"};

    private static String calc(int i, int j, String next, String comp) {
        if (data[i] == 0 && data[j] == 0) {
            return "";
        }

        if (data[i] == 0) {
            ++data[i];
            --data[j];
            return str[i];
        } else if(data[j] == 0){
            --data[i];
            ++data[j];
            return str[j];
        } else {
            if(data[i] == 1 && data[j] == 1) {
                if (next.equals(comp)) {
                    --data[i];
                    ++data[j];
                    return str[j];
                } else {
                    ++data[i];
                    --data[j];
                    return str[i];
                }
            } else if (data[i] > data[j]) {
                --data[i];
                ++data[j];
                return str[j];
            } else {
                ++data[i];
                --data[j];
                return str[i];
            }
        }
    }

    public static void main(String[] args) {
        var scanner = new Scanner(System.in);
        var n = scanner.nextInt();

        for (int i = 0; i < 3; ++i) {
            data[i] = scanner.nextInt();
        }

        var strs = new String[n];
        for (int i = 0; i < n; ++i) {
            strs[i] = scanner.next();
        }

        boolean ans = true;
        var rets = new String[n];
        for (int i = 0; i < n; ++i) {
            String next = "";
            if (i + 1 < n) {
                next = strs[i + 1];
            }

            if (strs[i].equals("AB")) {
                rets[i] = calc(0, 1, next, "BC");
                if (rets[i].equals("")) {
                    ans = false;
                    break;
                }
            }
            if (strs[i].equals("BC")) {
                rets[i] = calc(1, 2, next, "AC");
                if (rets[i].equals("")) {
                    ans = false;
                    break;
                }
            }
            if (strs[i].equals("AC")) {
                rets[i] = calc(0, 2, next, "BC");
                if (rets[i].equals("")) {
                    ans = false;
                    break;
                }
            }
        }

        if (ans) {
            System.out.println("Yes");
            for (int i = 0; i < n; ++i) {
                System.out.println(rets[i]);
            }
        } else {
            System.out.println("No");
        }
    }
}