/*input
2 1 3 0
AB
AC
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e10;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const ll maxn=1e5+5;
map<string,vector<int>> mp;
string arr[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,a,b,c;
    cin>>n>>a>>b>>c;
    REP(i,n){
        cin>>arr[i];
        mp[arr[i]].pb(i);
    }
    mp["AB"].pb(INF);
    mp["BC"].pb(INF);
    mp["AC"].pb(INF);
    vector<string> ans;
    REP(i,n){
        string s=arr[i];

        if(s=="AB"){
            if(a>b){
                --a,++b;
                ans.pb("B");
            }
            else if(a<b){
                --b,++a;
                ans.pb("A");
            }
            else{
                if((*lower_bound(ALL(mp["BC"]),i))>(*lower_bound(ALL(mp["AC"]),i))){
                    ++a,--b;
                    ans.pb("A");
                }
                else{
                    --a,++b;
                    ans.pb("B");
                }
            }
        }
        if(s=="BC"){
            if(b>c){
                --b,++c;
                ans.pb("C");
            }
            else if(b<c){
                --c,++b;
                ans.pb("B");
            }
            else{
                if((*lower_bound(ALL(mp["AB"]),i))>(*lower_bound(ALL(mp["AC"]),i))){
                    ++c,--b;
                    ans.pb("C");
                }
                else{
                    --c,++b;
                    ans.pb("B");
                }
            }
        }
        if(s=="AC"){
            if(a>c){
                --a,++c;
                ans.pb("C");
            }
            else if(a<c){
                --c,++a;
                ans.pb("A");
            }
            else{
                if((*lower_bound(ALL(mp["AB"]),i))>(*lower_bound(ALL(mp["BC"]),i))){
                    ++c,--a;
                    ans.pb("C");
                }
                else{
                    --c,++a;
                    ans.pb("A");
                }
            }
        }
        if(a<0 or b<0 or c<0){
            cout<<"No";
            return 0;
        }
    }
    cout<<"Yes\n";
    for(auto x:ans) cout<<x<<'\n';
}

Measured memory_bytes: 11116