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: Accepted)

#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <bitset>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
 
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
 
int main() {
    std::ios::sync_with_stdio(0); cin.tie(0);
 
    ll i,j,h;
    ll Q,M,K,P,A,B,C,N,X;
 
    long double x;
 
    string S;
 
    ll ans=0;
    ll count=0;
    ll flag=0;
    ll temp=0;
    vector<char> kotae;
    vector<string> ss;
    ll a,b;
    cin >>N>>A>>B>>C;

rep(i,N){
  cin>>S;
  ss.push_back(S);
}
//cout<<"aa"<<endl;
map <char,ll> mm;
mm['B']=B;
mm['A']=A;
mm['C']=C;
//cout<<0;
if(A+B+C==0){
  cout<<"No"<<endl;
  return 0;
}else if(A+B+C==1){
  rep(i,N){
  	if(mm[ss[i][0]]==0 && mm[ss[i][1]]==0){
      cout << "No"<<endl;
      return 0;
    }else if (mm[ss[i][0]]==0){
      mm[ss[i][0]]++;
      mm[ss[i][1]]--;
      kotae.push_back(ss[i][0]);
    }else{
      mm[ss[i][0]]--;
      mm[ss[i][1]]++;
      kotae.push_back(ss[i][1]);
    }
  }
}else{
    //cout<<"ee"<<endl;
    //cout<<ss[i][0<<ss[i][1]<<endl;
    
	if(mm[ss[0][0]]==0 && mm[ss[0][1]]==0){
        cout<<"No"<<endl;
        return 0;
    }else{
        
        rep(i,N){
            
            if(mm[ss[i][0]]==0){
                mm[ss[i][0]]++;
                mm[ss[i][1]]--;
                kotae.push_back(ss[i][0]);
            }else if(mm[ss[i][1]]==0){
                mm[ss[i][1]]++;
                mm[ss[i][0]]--;
                kotae.push_back(ss[i][1]);
            }else if(i!=N-1 && (mm[ss[i][0]]==1 || mm[ss[i][1]]==1)){
                if(ss[i+1][0]==ss[i][0] || ss[i+1][1]==ss[i][0] ){
                    mm[ss[i][1]]--;
                    mm[ss[i][0]]++;
                    kotae.push_back(ss[i][0]);
                    

                }else{
                    mm[ss[i][1]]++;
                    mm[ss[i][0]]--;
                    kotae.push_back(ss[i][1]);
                }
            
            }else{
                mm[ss[i][0]]--;
                mm[ss[i][1]]++;
                kotae.push_back(ss[i][1]);
            }
        }


    }
}
 

cout<<"Yes"<<endl;
rep(i,N){
    cout<<kotae[i]<<endl;
}
 
    return 0;
}