#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


#define AB 0
#define AC 1
#define BC 2



bool sim1(int N,int A,int B,int C,vi& s){
    assert(A+B+C == 1);
    int ball;
    if (A) ball=0;
    else if (B) ball=1;
    else if (C) ball=2;

    vector<char> res(N, '?');

    rep(i,N){
        switch(s[i]){
            case AB:
                switch (ball){
                    case 0:
                        res[i] = 'B';
                        ball = 1;
                        break;
                    case 1:
                        res[i] = 'A';
                        ball = 0;
                        break;
                    case 2:
                        return false;
                }
                break;
            case AC:
                switch (ball){
                    case 0:
                        res[i] = 'C';
                        ball = 2;
                        break;
                    case 2:
                        res[i] = 'A';
                        ball = 0;
                        break;
                    case 1:
                        return false;
                }
                break;
            case BC:
                switch (ball){
                    case 1:
                        res[i] = 'C';
                        ball = 2;
                        break;
                    case 2:
                        res[i] = 'B';
                        ball = 1;
                        break;
                    case 0:
                        return false;
                }
                break;
        }
    }

    printf("Yes\n");
    rep(i,N){
        printf("%c\n", res[i]);
    }
    return true;
}

bool sim2(int N,int A,int B,int C,vi& s){
    vector<char> res(N, '?');
    rep(i,N){
        switch(s[i]){
            case AB:
                if (A==0 && B==0) {
                    return false;
                } else if (A>0 && B==0) {
                    res[i] = 'B'; --A; ++B; break;
                } else if (A==0 && B>0) {
                    res[i] = 'A'; ++A; --B; break;
                } else {
                    if (i == N-1) {
                        res[i] = 'A'; ++A; --B; break;
                    } else {
                        switch(s[i+1]){
                            case AB:
                                res[i] = 'A'; res[i+1] = 'B'; ++i; break;
                            case AC:
                                res[i] = 'A'; ++A; --B; break;
                            case BC:
                                res[i] = 'B'; --A; ++B; break;
                        }
                    }
                }
                break;
            case AC:
                if (A==0 && C==0) {
                    return false;
                } else if (A>0 && C==0) {
                    res[i] = 'C'; --A; ++C; break;
                } else if (A==0 && C>0) {
                    res[i] = 'A'; ++A; --C; break;
                } else {
                    if (i == N-1) {
                        res[i] = 'A'; ++A; --C; break;
                    } else {
                        switch(s[i+1]){
                            case AC:
                                res[i] = 'A'; res[i+1] = 'C'; ++i; break;
                            case AB:
                                res[i] = 'A'; ++A; --C; break;
                            case BC:
                                res[i] = 'C'; --A; ++C; break;
                        }
                    }
                }
                break;
            case BC:
                if (B==0 && C==0) {
                    return false;
                } else if (B>0 && C==0) {
                    res[i] = 'C'; --B; ++C; break;
                } else if (B==0 && C>0) {
                    res[i] = 'B'; ++B; --C; break;
                } else {
                    if (i == N-1) {
                        res[i] = 'B'; ++B; --C; break;
                    } else {
                        switch(s[i+1]){
                            case BC:
                                res[i] = 'B'; res[i+1] = 'C'; ++i; break;
                            case AB:
                                res[i] = 'B'; ++B; --C; break;
                            case AC:
                                res[i] = 'C'; --B; ++C; break;
                        }
                    }
                }
                break;
        }
    }

    printf("Yes\n");
    rep(i,N){
        printf("%c\n", res[i]);
    }
    return true;
}


bool solve(int N,int A,int B,int C,vi& s){
    int sum = A+B+C;
    if (sum == 0) return false;
    if (sum == 1) return sim1(N,A,B,C,s);
    return sim2(N,A,B,C,s);
}

int main() {
    int N,A,B,C; scanf("%d %d %d %d%*c", &N,&A,&B,&C);

    vi s(N);
    rep(i,N){
        char x,y; scanf("%c%c%*c", &x, &y);
        if (x=='A' && y=='B') s[i]=AB;
        if (x=='A' && y=='C') s[i]=AC;
        if (x=='B' && y=='C') s[i]=BC;
    }
    if (!solve(N,A,B,C,s)){
        printf("No\n");
    }
    return 0;
}


Measured memory_bytes: 3864