#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);
}


const int INF = 999999;

template <typename T>
void make_adjacent(int nV, vector<pair<ii,T>>& arcs, vector<vector<pair<int,T>>>& adj) {
	adj.resize(nV);
	for (pair<ii, T> p: arcs) {
		int u = p.first.first, v = p.first.second;
		assert(u != v);
		T distance = p.second;
		adj[u].push_back(make_pair(v, distance));
		adj[v].push_back(make_pair(u, distance));
	}
}

template <typename T>
vi dij1(int nV, vector<vector<pair<int,T>>>& adjacent, vector<T>& d, int start) {
	d.assign(nV, INF);
	d[start] = 0;
	vector<int> prev(nV, -1);

	priority_queue<pair<T, int>> Q;
	Q.push(make_pair(0, start));

	vector<bool> visited(nV, false);

	while (!Q.empty()) {
		T du = -Q.top().first;
		int u = Q.top().second; Q.pop();
		if (visited[u]) continue;
		visited[u] = true;

		int c = adjacent[u].size();
		for (int i=0; i<c; ++i) {
			int v = adjacent[u][i].first;
			T distance = adjacent[u][i].second;
			T alt = du + distance;
			if (d[v] > alt) {
				d[v] = alt;
				prev[v] = u;
				Q.push(make_pair(-alt, v));
			}
		}
	}
    return prev;
}

template <typename T>
void dij(int nV, vector<vector<pair<int,T>>>& adjacent, vector<vector<T>>& d) {
	d.resize(nV);
	for (int start=0; start<nV; ++start) {
		dij1(nV, adjacent, d[start], start);
	}
}


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

#define OFS(i,a,b,c) 27*(i)+9*(a)+3*(b)+(c)

bool solve(int N,int A,int B,int C,vi& s){

    int nV = (N+1)*27;

    vector<vector<ii>> adj(nV);

    auto connect = [&](int i,int a,int b,int c, int i2,int a2,int b2,int c2){
        if (IN(a2,0,2) && IN(b2,0,2) && IN(c2,0,2)){
            int u=OFS(i,a,b,c), v=OFS(i2,a2,b2,c2);
    		adj[u].emplace_back(v, 1);
        }
    };

    rep(i,N){
        rep(a,3)rep(b,3)rep(c,3){
            switch(s[i]){
                case AB:
                    connect(i,a,b,c, i+1,a-1,b+1,c);
                    connect(i,a,b,c, i+1,a+1,b-1,c);
                    break;
                case AC:
                    connect(i,a,b,c, i+1,a-1,b,c+1);
                    connect(i,a,b,c, i+1,a+1,b,c-1);
                    break;
                case BC:
                    connect(i,a,b,c, i+1,a,b-1,c+1);
                    connect(i,a,b,c, i+1,a,b+1,c-1);
                    break;
            }
        }
    }

    rep(a,3)rep(b,3)rep(c,3){
        if (A < a || B < b || C < c) continue;
        int start=OFS(0,a,b,c);
        vi d(nV, INF);
        vi prev = dij1(nV, adj, d, start);
        rep(a2,3)rep(b2,3)rep(c2,3){
            int goal=OFS(N,a2,b2,c2);
            if (d[goal] != INF){
                vi path;
                while (goal != start){
                    path.pb(goal);
                    goal = prev[goal];
                }
                path.pb(start);
                assert(path.size() == N+1);
                reverse(ALL(path));
                printf("Yes\n");
                rep(i,N){
                    int u=path[i]%27, v=path[i+1]%27;
                    int a=u/9, b=(u/3)%3, c=u%3;
                    int a2=v/9, b2=(v/3)%3, c2=v%3;
                    if (a2>a) printf("A\n");
                    else if (b2>b) printf("B\n");
                    else if (c2>c) printf("C\n");
                    else assert(false);
                }
                return true;
            }
        }
    }

    return false;
}

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: 154768