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 <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
//#include <numeric>
#pragma warning(disable:4996) 
 
typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
 
int dp[100005][64];
int prev[100005][64];

void solve()
{
    int n, a, b, c;
    scanf("%d%d%d%d", &n, &a, &b, &c);
    ll sum = (ll)a + b + c;

    vector<int> v;
    int i, j;
    for (i = 0; i < n; i++) {
        char str[5] = { 0 };
        scanf("%s", str);
        if (strcmp(str, "AB") == 0) {
            v.push_back(0);
        }
        else if (strcmp(str, "AC") == 0) {
            v.push_back(1);
        }
        else {
            v.push_back(2);
        }
    }

    vector<int> ans;
    for (i = 0; i < n; i++) {
        if (v[i] == 0) {
            if (a > b) {
                ans.push_back(1);
                a--; b++;
            }
            else {
                ans.push_back(0);
                a++; b--;
            }
        }
        else if (v[i] == 1) {
            if (a > c) {
                ans.push_back(2);
                a--; c++;
            }
            else {
                ans.push_back(0);
                a++; c--;
            }
        }
        else {
            if (b > c) {
                ans.push_back(2);
                b--; c++;
            }
            else {
                ans.push_back(1);
                b++; c--;
            }
        }
        if (a < 0 || b < 0 || c < 0) {
            printf("No\n"); return;
        }
    }

    printf("Yes\n");
    for (i = 0; i < n; i++) {
        char str0[5] = { 0 };
        str0[0] = 'A' + ans[i];
        printf("%s\n", str0);
    }

    return;
}

int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        //printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}