Problem:
Score : 600 points

Problem Statement

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.

Sample Input 1

2 1 3 0
AB
AC

Sample Output 1

Yes
A
C

You can successfully make two choices, as follows:

In the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.

In the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.

Sample Input 2

3 1 0 0
AB
BC
AB

Sample Output 2

No

Sample Input 3

1 0 9 0
AC

Sample Output 3

No

Sample Input 4

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB

Sample Output 4

Yes
C
B
B
C
C
B
A
A

Solution in Java (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.*;

public class Main {

	final static long MOD = 1000000007;
	public static String[] Ws = null;
	public static int wsIndx = 0;
	public static BufferedReader in = null;
	public static void main(String[] args) throws Exception {

		int N=nextInt();
		int A=nextInt();
		int B=nextInt();
		int C=nextInt();
		int[][] dp = new int[N+10][3];
		dp[0][0]=0;
		dp[0][1]=0;
		dp[0][2]=0;

		int ACnt = 0;
		int BCnt = 0;
		int CCnt = 0;
		int MAX=Math.max(Math.max(A,B),C);


		String[] S = new String[N];
		for(int i=0;i<N;i++){
			S[i] = nextString();
			if("AC".equals(S[i])){
				ACnt++;
				CCnt++;
			}else if("BC".equals(S[i])){
				BCnt++;
				CCnt++;

			}else{
				ACnt++;
				BCnt++;
			}
		}

		String[] w = new String[N];
		for(int i=0;i<N;i++){
			if("AC".equals(S[i])){
				if(A>C){
					A--;
					C++;
					ACnt--;
					CCnt--;
					w[i]="C";
				}else{
					A++;
					C--;
					ACnt--;
					CCnt--;
					w[i]="A";
				}
			}else if("BC".equals(S[i])){
				if(B>C){
					B--;
					C++;
					BCnt--;
					CCnt--;
					w[i]="C";
				}else{
					B++;
					C--;
					BCnt--;
					CCnt--;
					w[i]="B";
				}

			}else{
				if(A>0&&A>B){
					A--;
					B++;
					ACnt--;
					BCnt--;
					w[i]="B";
				}else{
					A++;
					B--;
					ACnt--;
					BCnt--;
					w[i]="A";
				}
			}

		}
		if(A<0||B<0||C<0){
			System.out.println("No");
			return;
		}else{
			System.out.println("Yes");
			for(int i=0;i<N;i++){
				System.out.println(w[i]);
			}
		}

	}
	public static String[] toStringArray(String s) {
		String[] tmp = new String[s.length()];
		char[] c = s.toCharArray();
		for (int i = 0; i < tmp.length; i++) {
			tmp[i] = String.valueOf(c[i]);
		}
		return tmp;
	}

	public static void check() throws Exception{
		if(in == null){
			in = new BufferedReader(new InputStreamReader(System.in));
		}
		if(Ws==null || Ws.length<=wsIndx){
			Ws = in.readLine().split(" ");
			wsIndx=0;
		}
	}
	public static int nextInt()throws Exception{
		check();
		return Integer.parseInt(Ws[wsIndx++]);
	}

	public static long nextLong()throws Exception{
		check();
		return Long.parseLong(Ws[wsIndx++]);
	}

	public static String nextString()throws Exception{
		check();
		return Ws[wsIndx++];
	}

	public static int[] nextInts()throws Exception{
		check();
		int[] tmp = new int[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Integer.parseInt(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static long[] nextLongs()throws Exception{
		check();
		long[] tmp = new long[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Long.parseLong(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static String[] nextStrings()throws Exception{
		check();
		wsIndx=Ws.length;
		return Ws;
	}


}