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.PrintWriter;
import java.util.*;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = Integer.parseInt(sc.next());
        Map<Character, Integer> m = new HashMap<Character, Integer>();
        m.put('A', Integer.parseInt(sc.next()));
        m.put('B', Integer.parseInt(sc.next()));
        m.put('C', Integer.parseInt(sc.next()));
        String[] s = new String[n];
        for (int i = 0; i < n; i++) s[i] = sc.next();
        List<Character> r = new ArrayList<Character>();
        for (int i = 0; i < n - 1; i++) {
            char a = s[i].charAt(0);
            char b = s[i].charAt(1);
            if (m.get(a) == 0 || m.get(b) == 0) {
                if (m.get(a) == 0) {
                    m.put(a, m.get(a) + 1);
                    m.put(b, m.get(b) - 1);
                    r.add(a);
                }
                else {
                    m.put(a, m.get(a) - 1);
                    m.put(b, m.get(b) + 1);
                    r.add(b);
                }
            }
            else {
                if (s[i + 1].indexOf(a) > -1) {
                    m.put(a, m.get(a) + 1);
                    m.put(b, m.get(b) - 1);
                    r.add(a);
                }
                else{
                    m.put(a, m.get(a) - 1);
                    m.put(b, m.get(b) + 1);
                    r.add(b);
                }
            }
            for (Integer j : m.values()) {
                if (j < 0) {
                    out.println("No");
                    out.flush();
                    return;
                }
            }
        }
        char a = s[n - 1].charAt(0);
        char b = s[n - 1].charAt(1);
        if (m.get(a) == 0) {
            m.put(a, m.get(a) + 1);
            m.put(b, m.get(b) - 1);
            r.add(a);
        }
        else {
            m.put(a, m.get(a) - 1);
            m.put(b, m.get(b) + 1);
            r.add(b);
        }
        for (Integer i : m.values()) {
            if (i < 0) {
                out.println("No");
                out.flush();
                return;
            }
        }
        out.println("Yes");
        for (Character i : r) {
            out.println(i);
        }
        out.flush();
    }
}