#pragma region Macros
#include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define ALL(x) (x).begin(), (x).end()
#define REV(x) reverse(ALL(x))
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define SP << " " <<
#define INF2 1000000000000000037
#define INF  1000000007
#define lwb(x,n) distance(x.begin(),lower_bound(ALL(x),(n)))
#define upb(x,n) distance(x.begin(),upper_bound(ALL(x),(n)))
#define fora(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#ifdef _MY_DEBUG
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define de(...) CHOOSE((__VA_ARGS__,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define de(...)
#endif
using namespace std;
using ll = long long;
using ld = long double;
template<class T = ll> using v = vector<T>;
template<class T = ll> using vv = vector<vector<T>>;
template<class T = ll> using vvv = vector<vector<vector<T>>>;
template<class T> bool maxi(T &a, const T &b){ if(a<b){a=b;return 1;}return 0;}
template<class T> bool mini(T &a, const T &b){ if(b<a){a=b;return 1;}return 0;}
template<class T> ll sumer(const T& a){ return accumulate(ALL(a),0LL); }
template<class T> void UNIQUE(vector<T> &a){ SORT(a);a.erase(unique(ALL(a)),a.end());}
template<class T, class U> ostream &operator<<(ostream &os, const pair<T,U> &pe) { os << pe.first << " " << pe.second; return os;}
template<class T> ostream &operator<<(ostream &os, const v<T> &ve) { rep(i,ve.size()) os<< (i?" ":"")<<ve[i]; return os;}
ll topbit(ll a) { return a==0?-1:63-__builtin_clzll(a);}
ll botbit(ll a) { return a==0?64:__builtin_ctzll(a);}
ll popcount(ll a) { return __builtin_popcountll(a);}
#define dame {cout<< retword <<"\n"; return;}
#pragma endregion
//--MODIFS---------------------------------
#pragma region Modifs
#define retword "No"
#define MOD  1000000007
using P  = pair<ll,ll>;
using TP  = tuple<ll,ll,ll>;
#pragma endregion
//--GLOBAL---------------------------------

//--MAIN-----------------------------------
void Main() {
    ll N,A,B,C;
    cin>>N>>A>>B>>C;
    v<> D(N);
    string ans;
    // v<> tugi(N);
    rep(i,N){
        string S; cin>>S;
        ll num;
        if(S=="AB") num=2; 
        if(S=="AC") num=1; 
        if(S=="BC") num=0;
        D[i]=num;
    }
    ll tugi=0;
    rep(i,N){
        while(tugi<N and D[tugi]==D[i]){
            ++tugi;
        }
        ll num=D[i];
        if(num==0){
            if(B==0 and C==0) dame;
            if(B==0){
                ans+='B'; ++B; --C; continue;
            }
            if(C==0){
                ans+='C'; ++C; --B; continue;
            }
            if(B==1 and C==1){
                if(tugi==N or D[tugi]==1){
                    ans+='C'; ++C; --B; continue;
                }
                else{
                    ans+='B'; ++B; --C; continue;
                }
            }
            else{
                if(B>=C){
                    ans+='C'; ++C; --B; continue;
                }
                else{
                    ans+='B'; ++B; --C; continue;
                }
            }
        }

        if(num==1){
            if(A==0 and C==0) dame;
            if(A==0){
                ans+='A'; ++A; --C; continue;
            }
            if(C==0){
                ans+='C'; ++C; --A; continue;
            }
            if(A==1 and C==1){
                if(tugi==N or D[tugi]==0){
                    ans+='C'; ++C; --A; continue;
                }
                else{
                    ans+='A'; ++A; --C; continue;
                }
            }
            else{
                if(A>=C){
                    ans+='C'; ++C; --A; continue;
                }
                else{
                    ans+='A'; ++A; --C; continue;
                }
            }
        }

        if(num==2){
            if(A==0 and B==0) dame;
            if(A==0){
                ans+='A'; ++A; --B; continue;
            }
            if(B==0){
                ans+='B'; ++B; --A; continue;
            }
            if(A==1 and B==1){
                if(tugi==N or D[tugi]==0){
                    ans+='B'; ++B; --A; continue;
                }
                else{
                    ans+='A'; ++A; --B; continue;
                }
            }
            else{
                if(A>=B){
                    ans+='B'; ++B; --A; continue;
                }
                else{
                    ans+='A'; ++A; --B; continue;
                }
            }
        }
    }
    cout<< "Yes" <<"\n";
    rep(i,N){
        cout<< ans[i] <<"\n";
    }
    
}
//--START---------------------------------- 
int main() {
    cin.tie(nullptr); ios_base::sync_with_stdio(false);
    // ifstream in("input.txt"); cin.rdbuf(in.rdbuf());
    // ofstream out("output.txt"); cout.rdbuf(out.rdbuf());
    cout << fixed << setprecision(15);
    // ll Qkai; cin>>Qkai; rep(QQ,Qkai) Main();
    Main();
}
//-----------------------------------------

Measured memory_bytes: 4352