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.*;
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();
		List<String> route = new ArrayList<String>();

		boolean success = true;
		String s0 = sc.next();
		for (int i = 0; i < n; i++) {
			String s1 = "";
			if (i < n - 1) {
				s1 = sc.next();
			}
			if (s0.equals("AB")) {
				if (a == b) {
					if (s1.equals("AC") && c == 0) {
						a++;
						b--;
						route.add("A");
					} else if (s1.equals("BC") && c == 0) {
						a--;
						b++;
						route.add("B");
					} else {
						a++;
						b--;
						route.add("A");
					}
				} else if (a > b) {
					a--;
					b++;
					route.add("B");
				} else {
					a++;
					b--;
					route.add("A");
				}
			} else if (s0.equals("AC")) {
				if (a == c) {
					if (s1.equals("AB") && b == 0) {
						a++;
						c--;
						route.add("A");
					} else if (s1.equals("BC") && b == 0) {
						a--;
						c++;
						route.add("C");
					} else {
						a++;
						c--;
						route.add("A");
					}
				} else if (a > c) {
					a--;
					c++;
					route.add("C");
				} else {
					a++;
					c--;
					route.add("A");
				}
			} else if (s0.equals("BC")) {
				if (b == c) {
					if (s1.equals("AB") && a == 0) {
						b++;
						c--;
						route.add("B");
					} else if (s1.equals("AC") && a == 0) {
						b--;
						c++;
						route.add("C");
					} else {
						b++;
						c--;
						route.add("B");
					}
				} else if (b > c) {
					b--;
					c++;
					route.add("C");
				} else {
					b++;
					c--;
					route.add("B");
				}
			}

			if (a < 0 || b < 0 || c < 0) {
				success = false;;
				break;
			}
			s0 = s1;
		}

		// 出力
		if (!success) {
			System.out.println("No");
		} else {
			System.out.println("Yes");
			route.forEach( s -> {
				System.out.println(s);
			});
		}
		sc.close();
	}
}