#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

int n,t[3];
string s[100010];
P p[100010];

void solve(){
    cin >> n >> t[0] >> t[1] >> t[2];
    rep(i,n){
        cin >> s[i];
        if(s[i]=="AB")p[i]=P(0,1);
        if(s[i]=="BC")p[i]=P(1,2);
        if(s[i]=="AC")p[i]=P(0,2);
    }
    vector<int> ans={};
    if(t[0]+t[1]+t[2]==2){
        rep(i,n){
            if(t[p[i].first]==1 && t[p[i].second]==1){
                int not_next=0;
                rep(m,3){
                    if(m!=p[i+1].first && m!=p[i+1].second) not_next=m;
                }
                if(not_next==p[i].first){
                    t[p[i].first]=0;
                    t[p[i].second]=2;
                    ans.push_back(p[i].second);
                }
                else{
                    t[p[i].first]=2;
                    t[p[i].second]=0;
                    ans.push_back(p[i].first);
                }
            }
            else if(t[p[i].first]==2){
                t[p[i].first]=1;
                t[p[i].second]=1;
                ans.push_back(p[i].second);
            }
            else if(t[p[i].second]==2){
                t[p[i].first]=1;
                t[p[i].second]=1;
                ans.push_back(p[i].first);
            }
            else if(t[p[i].first]==1){
                t[p[i].first]=0;
                t[p[i].second]=1;
                ans.push_back(p[i].second);
            }
            else if(t[p[i].second]==1){
                t[p[i].first]=1;
                t[p[i].second]=0;
                ans.push_back(p[i].first);
            }
            else{
                cout << "No" << endl;
                return;
            }
        }
        cout << "Yes" << endl;
        rep(i,n){
            cout << (char)(ans[i]+'A') << endl;
        }
        return;
    }
    rep(i,n){
        if(t[p[i].first]>=2){
            ans.push_back(p[i].second);
            t[p[i].first]-=1;
            t[p[i].second]+=1;
        }
        else if(t[p[i].second]>=2){
            ans.push_back(p[i].first);
            t[p[i].first]+=1;
            t[p[i].second]-=1;
        }
        else if(t[p[i].first]>=1){
            ans.push_back(p[i].second);
            t[p[i].first]-=1;
            t[p[i].second]+=1;
        }
        else if(t[p[i].second]>=1){
            ans.push_back(p[i].first);
            t[p[i].first]+=1;
            t[p[i].second]-=1;
        }
        else{
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
    rep(i,n){
        cout << (char)(ans[i]+'A') << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}

Measured memory_bytes: 7796