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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author KharYusuf
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FThreeVariablesGame solver = new FThreeVariablesGame();
        solver.solve(1, in, out);
        out.close();
    }

    static class FThreeVariablesGame {
        public void solve(int testNumber, FastReader s, PrintWriter w) {
            int n = s.nextInt();
            int[] a = {s.nextInt(), s.nextInt(), s.nextInt()};
            ArrayList<Character> ans = new ArrayList<>();
            String st = s.next();
            for (int i = 0; i < n - 1; i++) {
                String next = s.next();
                if (st.equals(next)) {
                    if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                        ans.add(st.charAt(1));
                        a[st.charAt(0) - 'A']--;
                        a[st.charAt(1) - 'A']++;
                    } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                        ans.add(st.charAt(0));
                        a[st.charAt(1) - 'A']--;
                        a[st.charAt(0) - 'A']++;
                    } else if (a[st.charAt(0) - 'A'] > 0) {
                        ans.add(st.charAt(1));
                        a[st.charAt(0) - 'A']--;
                        a[st.charAt(1) - 'A']++;
                    } else {
                        w.println("No");
                        return;
                    }
                } else if (st.equals("AB")) {
                    if (next.equals("AC")) {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > 0) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    } else {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(0) - 'A'] > 0) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    }
                } else if (st.equals("AC")) {
                    if (next.equals("AB")) {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > 0) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    } else {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(0) - 'A'] > 0) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    }
                } else if (st.equals("BC")) {
                    if (next.equals("AB")) {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > 0) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    } else {
                        if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                            ans.add(st.charAt(0));
                            a[st.charAt(1) - 'A']--;
                            a[st.charAt(0) - 'A']++;
                        } else if (a[st.charAt(0) - 'A'] > 0) {
                            ans.add(st.charAt(1));
                            a[st.charAt(0) - 'A']--;
                            a[st.charAt(1) - 'A']++;
                        } else {
                            w.println("No");
                            return;
                        }
                    }
                }
                st = next;
            }
            if (a[st.charAt(0) - 'A'] > a[st.charAt(1) - 'A']) {
                ans.add(st.charAt(1));
                a[st.charAt(0) - 'A']--;
                a[st.charAt(1) - 'A']++;
            } else if (a[st.charAt(1) - 'A'] > a[st.charAt(0) - 'A']) {
                ans.add(st.charAt(0));
                a[st.charAt(1) - 'A']--;
                a[st.charAt(0) - 'A']++;
            } else if (a[st.charAt(0) - 'A'] > 0) {
                ans.add(st.charAt(1));
                a[st.charAt(0) - 'A']--;
                a[st.charAt(1) - 'A']++;
            } else {
                w.println("No");
                return;
            }
            w.println("Yes");
            for (char c : ans) w.println(c);
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {

            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {

                curChar = 0;

                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }

            return buf[curChar++];
        }

        public int nextInt() {

            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();

                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public String next() {

            int c = read();

            while (isSpaceChar(c))
                c = read();

            StringBuilder res = new StringBuilder();

            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c) {

            if (filter != null)
                return filter.isSpaceChar(c);

            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}