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>
#define ll long long int
#define pb push_back
#define se second
#define fi first
#define rep(i, l, r) for (ll i = (ll)(l); i < (ll)(r); i++)
#define print(v) for (const auto itr : v){cout << itr << ' ';} cout << endl;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define inf 1e18
using namespace std;
const ll INF = 1e18L + 5;
const ll maxn = 1e5+5, maxn1=202;
ll ceel(ll a, ll b)
{
   if (a % b == 0)
       return a / b;
   return a / b + 1;
}
ll modneg(ll a,ll m)
{
    a = a % m;
    if(a<0)
        a=a+m;
    return a;
}
ll powermod(ll x, unsigned ll y, ll p){ll res = 1;x = x % p;while (y > 0){if (y & 1){res = (res*x) % p;}y = y>>1; x = (x*x) % p;}return res;}
ll lcm(ll a, ll b) { return (a * b) / __gcd(a, b); };
ll csb(ll n){ ll count = 0;while (n){ count += n & 1; n >>= 1; } return count;}
string s[100005];
stack <char> st;
ll n;

bool calc(ll idx,ll a,ll b,ll c)
{
    // cout<<idx<<" "<<a<<" "<<b<<" "<<c<<endl;
    if(a<0 or b<0 or c<0)
        return 0;
    if(idx==n and a>0 and b>0 and c>0)
        return true;

    if(s[idx][0]=='A' and s[idx][1]=='C')
    {
        bool ans=calc(idx+1,a+1,b,c-1);
        if(ans)
        {
            st.push('A');
            return 1;
        }
        ans = calc(idx + 1, a - 1, b, c + 1);
        if (ans)
        {
            st.push('C');
            return 1;
        }
        return 0;
    }
    if (s[idx][0] == 'A' and s[idx][1] == 'B')
    {
        bool ans = calc(idx + 1, a + 1, b - 1, c );
        if (ans)
        {
            st.push('A');
            return 1;
        }
        ans = calc(idx + 1, a - 1, b + 1, c );
        if (ans)
        {
            st.push('B');
            return 1;
        }
        return 0;
    }
    if (s[idx][0] == 'B' and s[idx][1] == 'C')
    {
        bool ans = calc(idx + 1, a , b + 1, c - 1);
        if (ans)
        {
            st.push('B');
            return 1;
        }
        ans = calc(idx + 1, a , b - 1, c + 1);
        if (ans)
        {
            st.push('C');
            return 1;
        }
        return 0;
    }
}

int main()
{

fastIO;
ll test,t,i,j,k,m,a,b,c,x,y,u,temp;
cin>>n>>a>>b>>c;
rep(i,0,n)
{
    cin>>s[i];
    sort(s[i].begin(),s[i].end());
}
if(calc(0,a,b,c))
{
    cout<<"Yes\n";
    while(!st.empty())
    {
        cout<<st.top()<<endl;
        st.pop();
    }
}
else
{
    cout<<"No";
}
return 0;
}