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 C++ (GCC 9.2.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
using namespace std;

#define ran 101101

int n;
int A, B, C;
char s[ran][3];

bool f[ran][7][7][7];
char ch[ran][7][7][7], ans[ran];

void upd(int i, int a, int b, int c, char x) {
	if(a<0 || b<0 || c<0) return;
	if(f[i][a][b][c]) return;
	
	f[i][a][b][c] = true;
	ch[i][a][b][c] = x;
}

int main() {
	scanf("%d%d%d%d", &n, &A, &B, &C);
	
	A = min(A, 2);
	B = min(B, 2);
	C = min(C, 2);
	upd(0, A, B, C, 'A');
	for(int i=1;i<=n;i++) {
		scanf("%s", s[i]);
		
		for(int a=0;a<7;a++)
		for(int b=0;b<7;b++)
		for(int c=0;c<7;c++) {
			if(!f[i-1][a][b][c]) continue;
			
			if(s[i][0]=='A' && s[i][1]=='B') {
				upd(i, a+1, b-1, c, 'A');
				upd(i, a-1, b+1, c, 'B');
			}
			if(s[i][0]=='A' && s[i][1]=='C') {
				upd(i, a+1, b, c-1, 'A');
				upd(i, a-1, b, c+1, 'C');
			}
			if(s[i][0]=='B' && s[i][1]=='C') {
				upd(i, a, b+1, c-1, 'B');
				upd(i, a, b-1, c+1, 'C');
			}
		}
	}
	
	A=B=C=-1;
	for(int a=0;a<7 && A<0;a++)
	for(int b=0;b<7 && B<0;b++)
	for(int c=0;c<7 && C<0;c++)
		if(f[n][a][b][c]) {
			A = a; B = b; C = c;
		}
	
	if(A<0) {
		puts("No");
		return 0;
	}
	
	for(int i=n;i>0;i--) {
		//printf("%d %d %d %d %d\n", i, A, B, C, f[i][A][B][C]);
		ans[i] = ch[i][A][B][C];
		if(ans[i]=='A') {
			A--;
			if(s[i][1]=='B') B++;
			else C++;
		}
		if(ans[i]=='B') {
			B--;
			if(s[i][0]=='A') A++;
			else C++;
		}
		if(ans[i]=='C') {
			C--;
			if(s[i][0]=='A') A++;
			else B++;
		}
	}
	puts("Yes");
	for(int i=1;i<=n;i++) printf("%c\n", ans[i]);
	
	return 0;
}