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;

typedef long long ll;

ll nums[3];
char answer[100002];
string S[100002];

ll alphabet2num(char alphabet){
    if (alphabet=='A') return 0;
    if (alphabet=='B') return 1;
    if (alphabet=='C') return 2;
    else return -1;
}

char num2alphabet(ll num){
    if (num==0) return 'A';
    if (num==1) return 'B';
    if (num==2) return 'C';
    else return 'X';
}


bool isCharIncludedInStr(char c, string s){
    for(int i=0; i<s.size(); i++){
        if (c==s[i]) return true;
    }
    return false;
}


int main(){
    ll N, l, r;
    string s;
    cin >> N >> nums[0] >> nums[1] >> nums[2];
    for(int i=0; i<N; i++){
        cin >> S[i];
    }


    ll sum = nums[0] + nums[1] + nums[2];
    if (sum == 0){
        cout << "No" << endl;
        return 0;
    }
    else if (sum==1){
        for(ll i=0; i<N; i++){
            s = S[i];
            l = alphabet2num(s[0]);
            r = alphabet2num(s[1]);
            if (max(nums[l], nums[r])<=0){
                cout << "No"<< endl;
                return 0;
            }
            if (nums[l] < nums[r]){
                answer[i] = num2alphabet(l);
                nums[l] ++;
                nums[r] --;
            }else{
                answer[i] = num2alphabet(r);
                nums[l] --;
                nums[r] ++;
            }
        }
        cout << "Yes" << endl;
        for(ll i=0; i<N; i++){
            cout << answer[i] << endl;
        }
        return 0;
    }else{
        for(ll i=0; i<N; i++){
            s = S[i];
            l = alphabet2num(s[0]);
            r = alphabet2num(s[1]);

            if (nums[l]==0 && nums[r]==0){
                cout << "No" << endl;
                return 0;
            }
            if (nums[l]==0 && nums[r]>0){
                answer[i] = num2alphabet(l);
                nums[l] ++;
                nums[r] --;
            }else if (nums[l]>0 && nums[r]==0){
                answer[i] = num2alphabet(r);
                nums[l] --;
                nums[r] ++;
            }else if (sum==2 && nums[l]==1 && nums[r]==1 && i!=N-1 && S[i]!=S[i+1]){
                if (isCharIncludedInStr(s[1], S[i+1])){
                    answer[i] = num2alphabet(r);
                    nums[l] --;
                    nums[r] ++;
                }else{
                    answer[i] = num2alphabet(l);
                    nums[l] ++;
                    nums[r] --;
                }
            }else{
                answer[i] = num2alphabet(l);
                nums[l] ++;
                nums[r] --;
            }
        }

        cout << "Yes" << endl;
        for(ll i=0; i<N; i++){
            cout << answer[i] << endl;
        }
    }

    return 0;
}