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>
#define FOR(i, begin, end) for(ll i = (begin); i < (end); i++)
#define rep(i, n) FOR(i, 0, n)
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>;
template<typename T, typename U> static void chmin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void chmax(T &x, U y) { if (x < y) x = y; }

struct abc {
    int a,b,c;
    string s;
    abc(int a, int b, int c, string s="") 
        :a(a),b(b),c(c),s(s) {}
    bool operator<(abc y) {
        return a < y.a;
    }
};
signed main() {
    int n;
    vector<abc> x,next;
    int aa,bb,cc;
    cin>>n>>aa>>bb>>cc;
    x.push_back({aa,bb,cc});
    
    rep(i,n) {
        string s;
        cin>>s;
        if(s=="AB") {
            for(abc xx : x) {
                int a = xx.a, b= xx.b, c=xx.c;
                string s = xx.s;
                if(b-1>=0)
                    next.push_back({a+1, b-1, c, s+'A'});
                if(a-1>=0)
                    next.push_back({a-1, b+1, c, s+'B'});
            }
        } else if(s=="BC") {
            for(abc xx : x) {
                int a = xx.a, b= xx.b, c=xx.c;
                string s = xx.s;
                if(b-1>=0)
                    next.push_back({a, b-1, c+1, s+'C'});
                if(c-1>=0)
                    next.push_back({a, b+1, c-1, s+'B'});
            }
        } else {
            for(abc xx : x) {
                int a = xx.a, b= xx.b, c=xx.c;
                string s = xx.s;
                if(b-1>=0)
                    next.push_back({a+1, b, c-1, s+'B'});
                if(c-1>=0)
                    next.push_back({a-1, b, c+1, s+'C'});
            }
        }
        x = next;
        next = vector<abc>();
        if(x.size() == 0) {
            cout<<"No"<<endl;
            return 0;
        }
    }
    abc ss = x.back();
    cout<<"Yes"<<endl;
    for(char c : ss.s) {
        cout<<c<<endl;
    }
    return 0;
}