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: Wrong Answer)

#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
using namespace std;
#define rep(N) for(int i=0;i<N;i++)
#define rep2(N1,N2) for(int i=0;i<N1;i++)for(int j=0;j<N2;j++)
#define rep3(N1,N2,N3)for(int i=0;i<N1;i++)for(int j=0;j<N2;j++)for(int k=0;k<N3;k++)
#define For(i,N) for(int i=0;i<N;i++)
#define ll long long int
void yn(bool b) {
	if (b)printf("yes\n");
	else printf("no\n");
}

void Yn(bool b) {
	if (b)printf("Yes\n");
	else printf("No\n");
}

void YN(bool b) {
	if (b)printf("YES\n");
	else printf("NO\n");
}

int ctoi(char c) {
	return c - '0';
}


int main() {
	ll N,A,B,C;
	cin >> N>>A>>B>>C;
	vector<string>M(N);
	vector<char> S;
	rep(N) {
		cin >> M[i];
	}
	int flag = 1;
	rep(N) {
		if (M[i] == "AB") {
			if (A > 1) {
				A -= 1;
				B += 1;
				S.push_back('B');
			}
			else if(B > 1) {
				B -= 1;
				A += 1;
				S.push_back('A');
			}
			else if (A == 0 && B == 0) {
				flag = 0;
				break;
			}
			else if (A == 1 && B == 1) {
				if (i < N - 1) {
					if (M[i + 1] == "AB") {
						B -= 1;
						A += 1;
						S.push_back('A');
					}
					if (M[i + 1] == "AC") {
						B -= 1;
						A += 1;
						S.push_back('A');
					}
					if (M[i + 1] == "BC") {
						B += 1;
						A -= 1;
						S.push_back('B');
					}
				}
				else {
					B += 1;
					A -= 1;
					S.push_back('B');
				}
			}
			else {
				if (A == 1) {
					B += 1;
					A -= 1;
					S.push_back('B');
				}
				else {
					B -= 1;
					A += 1;
					S.push_back('A');
				}
			}
		}
		else if (M[i] == "AC") {
			if (A > 1) {
				A -= 1;
				C += 1;
				S.push_back('C');
			}
			else if (C > 1) {
				C -= 1;
				A += 1;
				S.push_back('A');
			}
			else if (A == 0 && C == 0) {
				flag = 0;
				break;
			}
			else if (A == 1 && C == 1) {
				if (i < N - 1) {
					if (M[i + 1] == "AC") {
						C -= 1;
						A += 1;
						S.push_back('A');
					}
					if (M[i + 1] == "AB") {
						C -= 1;
						A += 1;
						S.push_back('A');
					}
					if (M[i + 1] == "BC") {
						C += 1;
						A -= 1;
						S.push_back('C');
					}
				}
				else {
					C -= 1;
					A += 1;
					S.push_back('A');
				}
			}
			else {
				if (A == 1) {
					C += 1;
					A -= 1;
					S.push_back('C');
				}
				else {
					C -= 1;
					A += 1;
					S.push_back('A');
				}
			}
		}
		else if (M[i] == "BC") {
		if (B > 1) {
			B -= 1;
			C += 1;
			S.push_back('C');
		}
		else if (C > 1) {
			C -= 1;
			B += 1;
			S.push_back('B');
		}
		else if (B == 0 && C == 0) {
			flag = 0;
			break;
		}
		else if (B == 1 && C == 1) {
			if (i < N - 1) {
				if (M[i + 1] == "AC") {
					B -= 1;
					C += 1;
					S.push_back('C');
				}
				if (M[i + 1] == "AB") {
					C -= 1;
					A += 1;
					S.push_back('A');
				}
				if (M[i + 1] == "BC") {
					C += 1;
					A -= 1;
					S.push_back('C');
				}
			}
			else {
				C -= 1;
				B += 1;
				S.push_back('B');
			}
		}
		else {
			if (B == 1) {
				C += 1;
				B -= 1;
				S.push_back('C');
			}
			else {
				C -= 1;
				B += 1;
				S.push_back('B');
			}
		}
		}
	}
	Yn(flag);
	if (flag == 1) {
		rep(N)
			cout << S[i]<<endl;
	}
}