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;

#define FOR(i, n) for(int i = 0; i < (int) n; i++)
#define rall(x) x.rbegin(), x.rend()
#define all(x) x.begin(), x.end()
#define PB push_back
#define F first
#define S second

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;

const ll MOD = 998244353;

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	int n, a, b, c; cin >> n >> a >> b >> c;
	vector<string> v(n);
	queue<int> q[3];
	//cout << "COE\n";
	FOR(i, n){
		cin >> v[i];
		if(v[i] == "AC")
			q[0].push(i);
		else if(v[i] == "AB")
			q[1].push(i);
		else
			q[2].push(i);
	}
	FOR(i, 3)
		if(q[i].size() == 0)
			q[i].push(MOD);
	bool ok = true;
	string ans;
	FOR(i, n){
		string s = v[i];
		if(a+b+c == 2){
			if(s == "AC"){
				if(c == 0){
					a--; c++;
					ans.PB('C');
				}else if(a == 0){
					a++; c--;
					ans.PB('A');
				}else if(q[1].front() < q[2].front()){
					a++; c--;
					ans.PB('A');
				}else{
					a--; c++;
					ans.PB('C');
				}
				q[0].pop();
			}else if(s == "AB"){
				if(a == 0){
					b--; a++;
					ans.PB('A');
				}else if(b == 0){
					b++; a--;
					ans.PB('B');
				}else if(q[0].front() < q[2].front()){
					a++; b--;
					ans.PB('A');
				}else{
					a--; b++;
					ans.PB('B');
				}
				q[1].pop();
			}else{
				if(c == 0){
					b--; c++;
					ans.PB('C');
				}else if(b == 0){
					b++; c--;
					ans.PB('B');
				}else if(q[0].front() < q[1].front()){
					c++; b--;
					ans.PB('C');
				}else{
					c--; b++;
					ans.PB('B');
				}
				q[2].pop();
			}
		}else if(s == "AC"){
			if(a < c){
				a++; c--;
				ans.PB('A');
			}else{
				a--; c++;
				ans.PB('C');
			}
			q[0].pop();
		}else if(s == "AB"){
			if(a < b){
				a++; b--;
				ans.PB('A');
			}else{
				a--; b++;
				ans.PB('B');
			}
			q[1].pop();
		}else{
			if(b < c){
				b++; c--;
				ans.PB('B');
			}else{
				b--; c++;
				ans.PB('C');
			}
			q[2].pop();
		}
		if(a < 0 || b < 0 || c < 0)
			ok = false;
		//cout << a << ' ' << b << ' ' << c << '\n';
	}

	if(ok){
		cout << "Yes\n";
		for(char c : ans)
			cout << c << '\n';
	}else
		cout << "No\n";

 	return 0;
}