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: Runtime Error)

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main(void) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll a, b, c, n;
    cin >> n >> a >> b >> c;
    vector<string> qq(n);
    for (int i = 0; i < n; i++) cin >> qq[i];
    vector<char> ans;
    bool ok = true;
    for (int i = 0; i < n; i++) {    
        assert(a >= 0 && b >= 0 && c >= 0);
        if (qq[i] == "AB") {
            if (!a && !b) {
                ok = false;
                break;
            }
            if (a == 1 && b == 1 && i < n - 1 && qq[i] == qq[i + 1]) {
                ok = false;
                break;
            }
            if (a == 1 && b == 1) {
                if (i == n - 1) {
                    ans.push_back('B');
                    break;
                }
                else if (qq[i + 1] == "AC") {
                    ++a, --b;
                    ans.push_back('A');
                }
                else if (qq[i + 1] == "BC") {
                    ++b, --a;
                    ans.push_back('B');
                }
            } else {
                if (a <= b) {
                    ++a, --b;
                    ans.push_back('A');
                } else {
                    --a, ++b;
                    ans.push_back('B');
                }
            }
        }
        else if (qq[i] == "BC") {
            if (!c && !b) {
                ok = false;
                break;
            }
            if (c == 1 && c == 1 && i < n - 1 && qq[i] == qq[i + 1]) {
                ok = false;
                break;
            }
            if (c == 1 && b == 1) {
                if (i == n - 1) {
                    ans.push_back('B');
                    break;
                }
                else if (qq[i + 1] == "AC") {
                    ++c, --b;
                    ans.push_back('C');
                }
                else if (qq[i + 1] == "AB") {
                    ++b, --a;
                    ans.push_back('B');
                }
            } else {
                if (c <= b) {
                    ++c, --b;
                    ans.push_back('C');
                } else {
                    --c, ++b;
                    ans.push_back('B');
                }
            }
        }
        else if (qq[i] == "AC") {
            if (!a && !c) {
                ok = false;
                break;
            }
            if (a == 1 && c == 1 && i < n - 1 && qq[i] == qq[i + 1]) {
                ok = false;
                break;
            }
            if (a == 1 && c == 1) {
                if (i == n - 1) {
                    ans.push_back('A');
                    break;
                }
                else if (qq[i + 1] == "AB") {
                    ++a, --b;
                    ans.push_back('A');
                }
                else if (qq[i + 1] == "BC") {
                    ++c, --a;
                    ans.push_back('C');
                }
            } else {
                if (a <= c) {
                    ++a, --c;
                    ans.push_back('C');
                } else {
                    --a, ++c;
                    ans.push_back('C');
                }
            }
        }
    }
    if (ok) {
        cout << "Yes\n";
        for (int i = 0; i < (int) ans.size(); i++)
            cout << ans[i] << '\n';
    } else 
        cout << "No\n";
    return 0;
}
/*
    if A == B and A != 1
    unless both query vars are 1, all choices are optimal
    1 0 1
    AC --> (2 0 0) or (0 0 2)
    depends on the next query.
    AB
    AC

*/