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();
		int A = sc.nextInt();
		int B = sc.nextInt();
		int C = sc.nextInt();
		String[] R = new String[N];
		String[] S = new String[N];
		for (int i = 0; i < N; i++) {
			S[i] = sc.next();
		}

		for (int i = 0; i < N; i++) {
			String s = S[i];
			if (s.equals("AB")) {
				if (A == B && A == 1 && i != N - 1 && !s.equals(S[i + 1])) {
					if (S[i + 1].contains("A")) {
						A++;
						B--;
						R[i] = "A";
					} else {
						A--;
						B++;
						R[i] = "B";
					}
				} else if (A > B) {
					A--;
					B++;
					R[i] = "B";
				} else {
					A++;
					B--;
					R[i] = "A";
				}
			} else if (s.equals("BC")) {
				if (B == C && B == 1 && i != N - 1 && !s.equals(S[i + 1])) {
					if (S[i + 1].contains("B")) {
						B++;
						C--;
						R[i] = "B";
					} else {
						B--;
						C++;
						R[i] = "C";
					}
				} else if (B > C) {
					B--;
					C++;
					R[i] = "C";
				} else {
					B++;
					C--;
					R[i] = "B";
				}
			} else {
				if (C == A && C == 1 && i != N - 1 && !s.equals(S[i + 1])) {
					if (S[i + 1].contains("C")) {
						C++;
						A--;
						R[i] = "C";
					} else {
						C--;
						A++;
						R[i] = "A";
					}
				} else if (C > A) {
					C--;
					A++;
					R[i] = "A";
				} else {
					C++;
					A--;
					R[i] = "C";
				}
			}
			if (A < 0 || B < 0 || C < 0) {
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
		for (int i = 0; i < N; i++) {
			System.out.println(R[i]);
		}
	}

}