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.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.IntStream;

/**
 * 解説通りに実装したソースコード
 */
public class Main {

	private static final char A = 'A';
	private static final char B = 'B';
	private static final char C = 'C';

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			int n = scanner.nextInt();
			int[] count = new int['Z'];
			count[A] = scanner.nextInt();
			count[B] = scanner.nextInt();
			count[C] = scanner.nextInt();
			char[][] s = new char[n][];
			IntStream.range(0, n).forEach(i -> s[i] = scanner.next().toCharArray());
			List<String> answer = new ArrayList<>();
			boolean result = true;
			for (int i = 0; i < n; i++) {
				if (0 == count[s[i][0]] + count[s[i][1]]) {
					result = false;
					break;
				}
				if (count[s[i][0]] > count[s[i][1]]) {
					count[s[i][0]]--;
					count[s[i][1]]++;
					answer.add(String.valueOf(s[i][1]));
				} else if (count[s[i][0]] < count[s[i][1]]) {
					count[s[i][0]]++;
					count[s[i][1]]--;
					answer.add(String.valueOf(s[i][0]));
				} else {
					// count[s[i][0]] == count[s[i][1]]
					if (i < n - 1) {
						// 次のパターンで判定する
						if ((s[i][0] == s[i + 1][0]) && (s[i][1] == s[i + 1][1])) {
							// 次のパターンが同じとき
							count[s[i][0]]++;
							count[s[i][1]]--;
							answer.add(String.valueOf(s[i][0]));
						} else if ((s[i][0] == s[i + 1][0]) || (s[i][0] == s[i + 1][1])) {
							// 次のパターンと同じ文字のものを+1とする
							count[s[i][0]]++;
							count[s[i][1]]--;
							answer.add(String.valueOf(s[i][0]));
						} else {
							count[s[i][0]]--;
							count[s[i][1]]++;
							answer.add(String.valueOf(s[i][1]));
						}
					} else {
						count[s[i][0]]++;
						count[s[i][1]]--;
						answer.add(String.valueOf(s[i][0]));
					}
				}
			}
			System.out.println(result ? "Yes" : "No");
			if (result) {
				answer.forEach(System.out::println);
			}
		}
	}
}