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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.MathContext;
import java.text.BreakIterator;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main{

	static int[] dx = new int[] { -1, 0, 1, 0, -1, -1, 1, 1 };
	static int[] dy = new int[] { 0, 1, 0, -1, -1, 1, -1, 1 };
	static int A, B, C;

	public static void main(String[] args) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int a = Integer.parseInt(st.nextToken());
		int b = Integer.parseInt(st.nextToken());
		int c = Integer.parseInt(st.nextToken());
		int[] arr = new int[3];
		arr[0] = a;
		arr[1] = b;
		arr[2] = c;
		String[] str = new String[n];
		for (int i = 0; i < str.length; i++) {
			str[i] = br.readLine();
		}
		boolean f = true;
		int[] ans = new int[n];
		for (int i = 0; i < n; i++) {
			String s = str[i];
			int id1 = s.charAt(0) - 'A';
			int id2 = s.charAt(1) - 'A';
			if (arr[id1] == 0 && arr[id2] == 0) {
				f = false;
			} else if (arr[id1] == 1 && arr[id2] == 1 && i != n - 1) {
				String t = str[i + 1];
				int x = t.charAt(0) - 'A';
				int y = t.charAt(1) - 'A';
				if (id1 == x || id1 == y) {
					arr[id1]++;
					arr[id2]--;
					ans[i] = id1;
				} else {
					arr[id1]--;
					arr[id2]++;
					ans[i] = id2;
				}
			} else if (arr[id1] > arr[id2]) {
				arr[id1]--;
				arr[id2]++;
				ans[i] = id2;
			} else {
				arr[id1]++;
				arr[id2]--;
				ans[i] = id1;
			}
		}
		if (f) {
			pw.println("Yes");
			for (int i = 0; i < ans.length; i++) {
				pw.println((char) ('A' + ans[i]));
			}
		} else
			pw.println("No");
		pw.flush();
	}

}