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: Accepted)

#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
#define puts(x) cout << x << endl
using namespace std;
int input() {
    int r;
    cin >> r;
    //scanf("%lld", &r);
    return r;
}
int n, a, b, c; string s[123456], ans;
signed main() {
    cin >> n >> a >> b >> c;
    for1(i, n)cin >> s[i];
    for1(i, n) {
        if (s[i] == "AB") {
            if (a + b == 0) {
                puts("No"); return 0;
            }
            if (a > b) { ans += 'B'; a--; b++; }
            else if (a < b) { ans += 'A'; a++; b--; }
            else if (s[i + 1] == "BC") { ans += 'B'; a--; b++; }
            else { ans += 'A'; a++; b--; }
        }
        else if (s[i] == "AC") {
            if (a + c == 0) {
                puts("No"); return 0;
            }
            if (a > c) { ans += 'C'; a--; c++; }
            else if (a < c) { ans += 'A'; a++; c--; }
            else if (s[i + 1] == "BC") { ans += 'C'; a--; c++; }
            else { ans += 'A'; a++; c--; }
        }
        else  {
            if (b + c == 0) {
                puts("No"); return 0;
            }
            if (b > c) { ans += 'C'; b--; c++; }
            else if (b < c) { ans += 'B'; b++; c--; }
            else if (s[i + 1] == "AC") { ans += 'C'; b--; c++; }
            else { ans += 'B'; b++; c--; }
        }
    }
    puts("Yes"); for (char ch : ans)puts(ch);
}