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: Runtime Error)

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl
#define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl
using namespace std;
typedef pair<ll, ll> pii;
typedef vector<vector<ll>> mat;
const ll mod = 1e9+7;
const int MAXN = 1e5+5;


int32_t main() {
	ll n;
	ll v[5];
	cin >> n >> v[0] >> v[1] >> v[2];

	int sum[3][n+5];
	string q[n+5];
	
	for(int i = 0; i < n; i++) {
		string s;
		cin >> q[i];
		s = q[i];
		
		for(auto k : s) {
			k -= 'A';
			k = int(k);
			sum[k][i]++;
		}
		if(i > 0) {
			sum[0][i] += sum[0][i-1];
			sum[1][i] += sum[1][i-1];
			sum[2][i] += sum[2][i-1];
		}
	}
	

	vector<char> ans;
	string aux = "ABC";
	
	for(int i = 0; i < n; i++) {
		string s = q[i];
		int pret = s[0]-'A';
		
		for(int k = 0; k < 3; k++) 
			if(v[0] < 0) {
				cout << "No" << endl;
				return 0;
			}
			
		for(auto k : s) {
			k -= 'A';
			k = int(k);
			if(sum[k][i+v[k]] - sum[k][i] == 0) {
				pret = k;
				break;
			}
			
			if( (sum[k][n-1] - sum[k][i]) + v[k] < n) {
				pret = k;
				break;
			}
			
			if(v[k] < v[pret])
				pret = k;
		}
		ans.pb(pret+'A');
		for(auto k : aux) {
			k -= 'A';
			k = int(k);
			if(k != pret) v[k]--;
			else v[k]++;
		}
	}
	
	for(int k = 0; k < 3; k++) 
		if(v[k] < 0) {
			cout << "No" << endl;
			return 0;
		}
		
	cout << "Yes" << endl;
	for(auto i : ans)
		cout << i << endl;
}