#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}

int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll n;cin>>n;
    ll a[3];cin>>a[0]>>a[1]>>a[2];
    string s[n];
    rep(i,0,n)cin>>s[i];
    ll sum=a[0]+a[1]+a[2];
    if(sum>=3||sum==1){
        vector<int> v;
        rep(i,0,n){
            int f=s[i][0]-'A',g=s[i][1]-'A';
            if(a[f]==0&&a[g]==0){
                cout<<"No"<<endl;
                return 0;
            }
            if(a[f]<a[g]){
                v.push_back(f);
                a[f]++;
                a[g]--;
            }
            else{
                v.push_back(g);
                a[f]--;
                a[g]++;
            }
        }
        cout<<"Yes"<<endl;
        rep(i,0,v.size()){
            cout<<(char)('A'+v[i])<<endl;
        }
    }
    else{
        bool dp[n+1][3][3][3];
        memset(dp,false,sizeof dp);
        dp[0][a[0]][a[1]][a[2]]=true;
        rep(i,0,n){
            int f=s[i][0]-'A',g=s[i][1]-'A';
            rep(j,0,3){
                rep(k,0,3){
                    rep(l,0,3){
                        if(f==0){
                            if(g==1){
                                if(j>0){
                                    dp[i+1][j-1][k+1][l]|=dp[i][j][k][l];
                                }
                                if(k>0){
                                    dp[i+1][j+1][k-1][l]|=dp[i][j][k][l];
                                }
                            }
                            else{
                                if(j>0){
                                    dp[i+1][j-1][k][l+1]|=dp[i][j][k][l];
                                }
                                if(l>0){
                                    dp[i+1][j+1][k][l-1]|=dp[i][j][k][l];
                                }
                            }
                        }
                        else if(f==1){
                            if(k>0){
                                dp[i+1][j][k-1][l+1]|=dp[i][j][k][l];
                            }
                            if(l>0){
                                dp[i+1][j][k+1][l-1]|=dp[i][j][k][l];
                            }
                        }
                    }
                }
            }
        }
        int b[3];
        fill(b,b+3,-1);
        rep(i,0,3){
            rep(j,0,3){
                rep(k,0,3){
                    if(dp[n][i][j][k]){
                        b[0]=i;
                        b[1]=j;
                        b[2]=k;
                        break;
                    }
                }
                if(b[0]>=0)break;
            }
            if(b[0]>=0)break;
        }
        if(b[0]==-1){
            cout<<"No"<<endl;
            return 0;
        }
        vector<int> v;
        rrep(i,n-1,0){
            if(s[i]=="AB"){
                if(b[0]>0){
                    if(dp[i][b[0]-1][b[1]+1][b[2]]){
                        b[0]--;
                        b[1]++;
                        v.push_back(0);
                        continue;
                    }
                }
                if(b[1]>0){
                    if(dp[i][b[0]+1][b[1]-1][b[2]]){
                        b[1]--;
                        b[0]++;
                        v.push_back(1);
                        continue;
                    }
                }
            }
            else if(s[i]=="AC"){
                if(b[0]>0){
                    if(dp[i][b[0]-1][b[1]][b[2]+1]){
                        b[0]--;
                        b[2]++;
                        v.push_back(0);
                        continue;
                    }
                }
                if(b[2]>0){
                    if(dp[i][b[0]+1][b[1]][b[2]-1]){
                        b[2]--;
                        b[0]++;
                        v.push_back(2);
                        continue;
                    }
                }
            }
            else{
                if(b[2]>0){
                    if(dp[i][b[0]][b[1]+1][b[2]-1]){
                        b[2]--;
                        b[1]++;
                        v.push_back(2);
                        continue;
                    }
                }
                if(b[1]>0){
                    if(dp[i][b[0]][b[1]-1][b[2]+1]){
                        b[1]--;
                        b[2]++;
                        v.push_back(1);
                        continue;
                    }
                }
            }
        }
        cout<<"Yes"<<endl;
        rrep(i,v.size()-1,0)cout<<(char)('A'+v[i])<<endl;
    }
}


Measured memory_bytes: 9652