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;

/*
int Swap[3][2] = {
{0, 1},
{0, 2},
{1, 2}
};
*/

int main() {
    int N;
    long long A[3];
    cin >> N >> A[0] >> A[1] >> A[2];
    vector<vector<long long*>> In(N,vector<long long*>(2));
    string s;
    for(int i = 0; i < N; ++i) {
        cin >> s;
        if(s == "AB") {
            In[i][0] = &A[0], In[i][1] = &A[1];
        }
        else if(s == "AC") {
            In[i][0] = &A[0], In[i][1] = &A[2];
        }
        else {
            In[i][0] = &A[1], In[i][1] = &A[2];
        }
    }

    if(A[0] + A[1] + A[2] == 0) {
        cout << "No" << endl;
        return 0;
    }

    vector<int> res(N);
    if(A[0] + A[1] + A[2] == 1) {
        for(int i = 0; i < N; ++i) 
        {
            auto &p = In[i];
            if(*p[0] == 0 && *p[1] == 0) 
            {
                cout << "No" << endl;
                return 0;
            }
            if(*p[0] == 0) 
            {
                res[i] = p[0] - A;
                ++(*p[0]), --(*p[1]);
            }
            else 
            {
                res[i] = p[1] - A;
                ++(*p[1]), --(*p[0]);
            }
        }
    }
    else {
        for(int i = 0; i < N; ++i)
        {
            auto &p = In[i];
            if(*p[0] == 0 && *p[1] == 0) 
            {
                cout << "No" << endl;
                return 0;
            }
            else if(*p[0] == 0) 
            {
                res[i] = p[0] - A;
                ++(*p[0]), --(*p[1]);
            }
            else if(*p[1] == 0)
            {
                res[i] = p[1] - A;
                ++(*p[1]), --(*p[0]);
            }
            else 
            {// *p[0] != 0 かつ *p[1] != 0 のとき
                if(i+1 < N) {
                    auto &q = In[i+1];
                    for(int j = 0; j < 2; ++j) {
                        for(int k = 0; k < 2; ++k) {
                            if(p[j] == q[k]) {
                                res[i] = p[j] - A;
                                ++(*p[j]), --(*p[j == 1 ? 0 : 1]);
                            }
                        }
                    }
                }
                else {
                    res[i] = p[0] - A;
                }
            }
        }
    }

    cout << "Yes" << endl;
    for(int i = 0; i < N; ++i) {
        cout << (char)(res[i] + 'A') << endl;
    }
    return 0;
}