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>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}

int main(){
    ll n,a,b,c;cin>>n>>a>>b>>c;
    string ans;
    if(a+b+c==2){
        vector<string> v(n);
        rep(i,n)cin>>v[i];
        rep(i,n){
        if(v[i]=="AB"){
            if(a+b==0)dame("No");
            if(!b){
                a--;b++;
                ans+='B';
            }
            else if(!a){
                a++;b--;
                ans+='A';
            }
            else{
                if(i!=n-1&&v[i+1]=="AC"){
                    a++;b--;
                    ans+='A';
                }
                else{
                    b++;a--;
                    ans+='B';
                }
            }
        }
        if(v[i]=="AC"){
            if(a+c==0)dame("No");
            if(!c){
                a--;c++;
                ans+='C';
            }
            else if(!a){
                a++;c--;
                ans+='A';
            }
            else{
                if(i!=n-1&&v[i+1]=="AB"){
                    a++;c--;
                    ans+='A';
                }
                else{
                    c++;a--;
                    ans+='C';
                }
            }
        }
        if(v[i]=="BC"){
            if(c+b==0)dame("No");
            if(!b){
                c--;b++;
                ans+='B';
            }
            else if(!c){
                c++;b--;
                ans+='C';
            }
            else{
                if(i!=n-1&&v[i+1]=="AC"){
                    c++;b--;
                    ans+='C';
                }
                else{
                    b++;c--;
                    ans+='B';
                }
            }
        }
        }
        out("Yes");
        for(char x:ans)out(x);
        return 0;
    }
    rep(i,n){
        string s;cin>>s;
        if(s=="AB"){
            if(a+b==0)dame("No");
            if(a>b){
                a--;b++;
                ans+='B';
            }
            else{
                a++;b--;
                ans+='A';
            }
        }
        if(s=="AC"){
            if(a+c==0)dame("No");
            if(a>c){
                a--;c++;
                ans+='C';
            }
            else{
                a++;c--;
                ans+='A';
            }
        }
        if(s=="BC"){
            if(c+b==0)dame("No");
            if(c>b){
                c--;b++;
                ans+='B';
            }
            else{
                c++;b--;
                ans+='C';
            }
        }
    }
    out("Yes");
    for(char x:ans)out(x);
}