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 <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define gc getchar_unlocked()
#define pc(x) putchar_unlocked(x)
template<typename T> void scan(T &x){x = 0;bool _=0;T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);}
template<typename T> void print(T n){printn(n);pc(10);}
template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);}

using namespace std;
using ll = long long;
const int MM = 1e5+5;

int n;
ll a[3];
string s;
int fir[MM], sec[MM];
vector<char> out;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin>>n>>a[0]>>a[1]>>a[2];
    
    if(a[0]+a[1]+a[2] == 0){
        return cout<<"No\n", 0;
    }
    
    for(int i = 1; i <= n; i++){
        cin>>s;
        fir[i] = s[0]-'A';
        sec[i] = s[1]-'A';
    }
    
    for(int i = 1; i <= n; i++){
        int b = fir[i], c = sec[i];
        
        if(a[b]+a[c] == 0)
            return cout<<"No\n", 0;
        
        if(a[b] == 1 and a[c] == 1 and i != n){
            //check next one
            set<int> st;
            st.insert(fir[i+1]);
            st.insert(sec[i+1]);
            
            if(st.count(b)){
                a[c]--, a[b]++;
                out.push_back(b+'A');
            }
            else{
                a[b]--, a[c]++;
                out.push_back(c+'A');
            }
        }
        else if(a[b] > a[c]){
            a[b]--, a[c]++;
            out.push_back(c+'A');
        }
        else{
            a[c]--, a[b]++;
            out.push_back(b+'A');
        }
    }
    cout<<"Yes\n";
    for(char c: out)
        cout<<c<<'\n';
    
    
    return 0;
}
/*
2 1 1 0
AB
BC

2 1 1 0
AB
AC
 */