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 11.0.6) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Map.Entry;

import java.util.PriorityQueue;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;


public class Main {
	
	public static void main(String[] args) throws IOException {	
		try(final Scanner sc = new Scanner(System.in)){
			final int N = sc.nextInt();
			long A = sc.nextLong();
			long B = sc.nextLong();
			long C = sc.nextLong();
			
			boolean ok = true;
			LinkedList<String> answer = new LinkedList<String>();
			
			String[] ops = new String[N];
			for(int i = 0; i < N; i++) {
				ops[i] = sc.next();
			}
			
			for(int i = 0; i < N; i++) {
				final String op = ops[i];
				
				if(op.equals("AB")) {
					if(A == 0 && B == 0) {
						ok = false; break;
					}else if(i < N - 1 && ops[i + 1].equals("AC") && B > 0 && C == 0) {
						answer.add("A");
						A++; B--;
					}else if(i < N - 1 && ops[i + 1].equals("BC") && A > 0 && C == 0) {
						answer.add("B");
						A--; B++;
					}else if(A <= B) {
						answer.add("A");
						A++; B--;
					}else {
						answer.add("B");
						A--; B++;
					}
				}else if(op.equals("BC")) {
					if(B == 0 && C == 0) {
						ok = false; break;
					}else if(i < N - 1 && ops[i + 1].equals("AB") && C > 0 && A == 0) {
						answer.add("B");
						B++; C--;
					}else if(i < N - 1 && ops[i + 1].equals("AC") && B > 0 && A == 0) {
						answer.add("C");
						B--; C++;
					}else if(B <= C) {
						answer.add("B");
						B++; C--;
					}else {
						answer.add("C");
						B--; C++;
					}
				}else if(op.equals("AC")) {
					if(A == 0 && C == 0) {
						ok = false; break;
					}else if(i < N - 1 && ops[i + 1].equals("AB") && C > 0 && B == 0) {
						answer.add("A");
						A++; C--;
					}else if(i < N - 1 && ops[i + 1].equals("BC") && A > 0 && B == 0) {
						answer.add("C");
						A--; C++;
					}else if(A <= C) {
						answer.add("A");
						A++; C--;
					}else {
						answer.add("C");
						A--; C++;
					}
				}
			}
			
			if(!ok) {
				System.out.println("No"); return;
			}else {
				System.out.println("Yes");
			}
			
			for(final String s : answer) {
				System.out.println(s);
			}
		}
	}

	public static class Scanner implements Closeable {
		private BufferedReader br;
		private StringTokenizer tok;

		public Scanner(InputStream is) throws IOException {
			br = new BufferedReader(new InputStreamReader(is));
		}

		private void getLine() throws IOException {
			while(!hasNext()){
				tok = new StringTokenizer(br.readLine());
			}
		}

		private boolean hasNext() {
			return tok != null && tok.hasMoreTokens();
		}

		public String next() throws IOException {
			getLine();
			return tok.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
		

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) throws IOException {
			final int[] ret = new int[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextInt();
			}
			return ret;
		}

		public long[] nextLongArray(int n) throws IOException {
			final long[] ret = new long[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextLong();
			}
			return ret;
		}

		public void close() throws IOException {
			br.close();
		}
	}
}