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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define fi first
#define se second
#define All(x) (x).begin(),(x).end()
#define TYPE(x) typeid(x).name()
vector<char>choices;
vector<string>pk;
int main(){
	int N,A,B,C;
	cin>>N>>A>>B>>C;
	int ans=1;
	for(int i=1;i<=N;++i){
		string s;
		cin>>s;
		pk.push_back(s);
	}
	for(int i=0;i<N;++i){
		string s;
		s=pk[i];
		bool aa=0,bb=0,cc=0;
		if(s[0]=='A')aa=1;
		if(s[0]=='B')bb=1;
		if(s[0]=='C')cc=1;
		if(s[1]=='A')aa=1;
		if(s[1]=='B')bb=1;
		if(s[1]=='C')cc=1;
		if(aa&&bb){
			if(A==0&&B==0){
				ans=0;break;
			}
			if(A!=0&&B==0){
				choices.push_back('B');
				--A;++B;
				break;
			}
			if(A==0&&B!=0){
				choices.push_back('A');
				++A;--B;
				break;
			}
			if(A>B){
				choices.push_back('B');
				--A;++B;
			}
			else if(A!=1&&B!=1){
				choices.push_back('A');
				--B;++A;
			}
			else {
				int needa=0,needb=0;
				for(int j=i+1;j<N;++j){
					if(pk[j][0]=='A'||pk[j][1]=='A'||pk[j][0]=='B'||pk[j][1]=='B'){
						if(pk[j][0]=='A'&&pk[j][1]!='B'){
							needa=1;break;
						}
						if(pk[j][1]=='A'&&pk[j][0]!='B'){
							needa=1;break;
						}
						if(pk[j][0]!='A'&&pk[j][1]=='B'){
							needb=1;break;
						}
						if(pk[j][1]!='A'&&pk[j][0]=='B'){
							needb=1;break;
						}
					}
				}
				if(needa==1){
				choices.push_back('A');
					++A;--B;
				}
				else{
				choices.push_back('B');
					++B;--A;
				}
			}
		}
		if(aa&&cc){
			if(A==0&&C==0){
				ans=0;break;
			}
			if(A!=0&&C==0){
				choices.push_back('C');
				--A;++C;
				break;
			}
			if(A==0&&C!=0){
				choices.push_back('A');
				++A;--C;
				break;
			}
			if(A>C){
				choices.push_back('C');
				--A;++C;
			}
			else if(A!=1&&C!=1){
				choices.push_back('A');
				--C;++A;
			}
			else {
				int needa=0,needc=0;
				for(int j=i+1;j<N;++j){
					if(pk[j][0]=='A'||pk[j][1]=='A'||pk[j][0]=='C'||pk[j][1]=='C'){
						if(pk[j][0]=='A'&&pk[j][1]!='C'){
							needa=1;break;
						}
						if(pk[j][1]=='A'&&pk[j][0]!='C'){
							needa=1;break;
						}
						if(pk[j][0]!='A'&&pk[j][1]=='C'){
							needc=1;break;
						}
						if(pk[j][1]!='A'&&pk[j][0]=='C'){
							needc=1;break;
						}
					}
				}
				if(needa==1){
				choices.push_back('A');
					++A;--C;
				}
				else{
				choices.push_back('C');
					++C;--A;
				}
			}
		}
		if(bb&&cc){
			if(B==0&&C==0){
				ans=0;break;
			}
			if(B!=0&&C==0){
				choices.push_back('C');
				--B;++C;
				break;
			}
			if(B==0&&C!=0){
				choices.push_back('B');
				++B;--C;
				break;
			}
			if(B>C){
				choices.push_back('C');
				--B;++C;
			}
			else if(B!=1&&C!=1){
				choices.push_back('B');
				--C;++B;
			}
			else {
				int needb=0,needc=0;
				for(int j=i+1;j<N;++j){
					if(pk[j][0]=='B'||pk[j][1]=='B'||pk[j][0]=='C'||pk[j][1]=='C'){
						if(pk[j][0]=='B'&&pk[j][1]!='C'){
							needb=1;break;
						}
						if(pk[j][1]=='B'&&pk[j][0]!='C'){
							needb=1;break;
						}
						if(pk[j][0]!='B'&&pk[j][1]=='C'){
							needc=1;break;
						}
						if(pk[j][1]!='B'&&pk[j][0]=='C'){
							needc=1;break;
						}
					}
				}
				if(needb==1){
				choices.push_back('B');
					++B;--C;
				}
				else{
				choices.push_back('C');
					++C;--B;
				}
			}
		}
	}
	if(ans==0||choices.size()!=N)cout<<"No";
	else{
		cout<<"Yes\n";
		for(auto i:choices){
			cout<<i<<'\n';
		}
	}
}
/*
2 1 1 0
AB
AC
2 1 1 0
AB
BC
*/