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 db(x) cout<<x<<'\n'
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define repi(i,n) for(int i=0;i<(n);++i)
//#define repA(i,a,n) for(int i=a;i<=(n);++i)
//#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define ll long long int
#define endl '\n'
#define lld long long double
#define vi vector<int> 
#define vl vector<ll> 
#define vb vector<bool> 
#define vvi vector<vector<int>  >
#define err(t) cout<<"Error : "<<t<<endl;
#define all(v) v.begin(),v.end()
#define mp make_pair
#define M 100000
#define MD 1000000007
#define pb push_back
#define rep(i,a,b) for(ll i = a; i <= (b); i++)
#define pii pair<int,int>
#define pll pair<ll,ll> 
#define vec(a) vector<a >
#define se second
#define fi first
#define inf 0xffffffff
#define inchar getchar_unlocked
#define outchar(x) putchar_unlocked(x)
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll binpow(ll a,ll b){	if(a==0) return 0; if(b==0) return 1;ll ans=1;while(b>0){if(b&1) ans=ans*a; a=a*a; b=b>>1;}	return ans;}


int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);cout.tie(NULL);
	 ll n,a,b,c;cin>>n>>a>>b>>c;
	 string ans="",s1[n],s;bool po=true,A,B,C;
	 repi(i,n) cin>>s1[i];
	 repi(i,n){
	 	A=B=C=false;
	 	
	 	s=s1[i];
	 	if(s[0]=='A'||s[1]=='A') A=true;
	 	if(s[0]=='B'||s[1]=='B') B=true;
	 	if(s[0]=='C'||s[1]=='C') C=true;
	 	
	 	if(a+b+c==0) po=false;
	 	else if(a+b+c==1){
	 		if(a==1 && A){
	 			a--;
	 			if(B) b++; else c++; 
	 		}
	 		else if(b==1 && B){
	 			b--;
	 			if(A) a++; else c++; 
	 		}
	 		else if(c==1 && C){
	 			c--;
	 			if(B) b++; else a++; 
	 		}
	 		else po=false;	
	 	}
	 	else{
	 		if(s=="AB"){
	 			if(a==0&&b==0) po=false;
	 			else if(a==0||b==0){
	 				if(a==0) a++,b--,ans+='A';
	 				else b++,a--,ans+='B';
	 			}
	 			else if(a==1&&b==1&&(i+1!=n)&&s1[i]!=s1[i+1]){
	 				char x=s[0]+s[1]+s1[i+1][0]+s1[i+1][1]-'A'-'B'-'C';
	 				if(x=='A') a++,b--,ans+='A';
	 				else b++,a--,ans+='B';
	 			}
	 			else{
	 				a++,b--,ans+='A';
	 			}
	 		}
	 		else if(s=="BC"){
	 			if(c==0&&b==0) po=false;
	 			else if(c==0||b==0){
	 				if(c==0) c++,b--,ans+='C';
	 				else b++,c--,ans+='B';
	 			}
	 			else if(c==1&&b==1&&(i+1!=n)&&s1[i]!=s1[i+1]){
	 				char x=s[0]+s[1]+s1[i+1][0]+s1[i+1][1]-'A'-'B'-'C';
	 				if(x=='C') c++,b--,ans+='C';
	 				else b++,c--,ans+='B';
	 			}
	 			else{
	 				c++,b--,ans+='C';
	 			}	 		
	 		}
	 		else {
	 			if(a==0&&c==0) po=false;
	 			else if(a==0||c==0){
	 				if(a==0) a++,c--,ans+='A';
	 				else c++,a--,ans+='C';
	 			}
	 			else if(a==1&&c==1&&(i+1!=n)&&s1[i]!=s1[i+1]){
	 				char x=s[0]+s[1]+s1[i+1][0]+s1[i+1][1]-'A'-'B'-'C';
	 				if(x=='A') a++,c--,ans+='A';
	 				else c++,a--,ans+='C';
	 			}
	 			else{
	 				a++,c--,ans+='A';
	 			}	 		
	 		}
	 	}
	 	ans+='\n';
	 }
	 if(po) {
	 	cout<<"Yes\n"<<ans;
	 }
	 else cout<<"No\n";
	// string s;cin>>s;
	
	//ll n;cin>>n; vl a(n); repi(i,n) cin>>a[i];
	
	
	/*
	int test1;cin>>test1;while(test1--){ 
		
	 }
	 //*/
return 0;
}