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;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        String[] sousa = new String[n];
        String s1 = sc.next();
        for (int i=1;i<=n;i++) {
            String s2 = "";
            if (sc.hasNext()) {
                s2 = sc.next();
            }
            if (s1.equals("AB")) {
                if (a==0 && b==0) {
                    System.out.println("No");
                    return;
                } else {
                    if (a>b) {
                        a--;
                        b++;
                        sousa[i-1] = "B";
                    } else if (a==b && s2.equals("BC")) {
                        a--;
                        b++;
                        sousa[i-1] = "B";
                    } else {
                        a++;
                        b--;
                        sousa[i-1] = "A";
                    }
                }
            }
            if (s1.equals("AC")) {
                if (a==0 && c==0) {
                    System.out.println("No");
                    return;
                } else {
                    if (a>c) {
                        a--;
                        c++;
                        sousa[i-1] = "C";
                    } else if (a==c && s2.equals("BC")) {
                        a--;
                        c++;
                        sousa[i-1] = "C";
                    } else {
                        a++;
                        c--;
                        sousa[i-1] = "A";
                    }
                }
            }
            if (s1.equals("BC")) {
                if (b==0 && c==0) {
                    System.out.println("No");
                    return;
                } else {
                    if (b>c) {
                        b--;
                        c++;
                        sousa[i-1] = "C";
                    } else if (b==c && s2.equals("AC")) {
                        b--;
                        c++;
                        sousa[i-1] = "C";
                    } else {
                        b++;
                        c--;
                        sousa[i-1] = "B";
                    }
                }
            }
            s1 = s2;
        }
        System.out.println("Yes");
        for (int i=0;i<n;i++) {
            System.out.println(sousa[i]);
        }
    }
}