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

public class Main{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int[] a = new int[3];
        a[0] = in.nextInt();
        a[1] = in.nextInt();
        a[2] = in.nextInt();
        in.nextLine();
        String[] s = new String[n];
        char[] out = new char[n];
        for(int i = 0; i < n; i++)
            s[i] = in.nextLine();
    

        for(int k = 0; k < n; k++){
            int i = (int)s[k].charAt(0)-(int)'A';
            int j= (int)s[k].charAt(1)-(int)'A';

            if(a[i] > a[j]){
                a[i]--;
                a[j]++;
                out[k] = (s[k].charAt(1));
            }
            else if(a[i] < a[j]){
                a[i]++;
                a[j]--;
                out[k] = (s[k].charAt(0));
            }
            else{
                if(a[i] + a[j] == 0){
                    System.out.println("No");
                    return;
                }
                if(k == n-1 || s[k+1].charAt(0) == s[k].charAt(0) || s[k+1].charAt(1) == s[k].charAt(0)){
                    a[i]++;
                    a[j]--;
                    out[k] = (s[k].charAt(0));
                }
                else{
                    a[i]--;
                    a[j]++;
                    out[k] = (s[k].charAt(1));
                }
            }
        }
        System.out.println("Yes");
        for(int i = 0; i < n; i++)
            System.out.println(out[i]);
    }
}