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

// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)

namespace io {
	const int __SIZE = (1 << 21) + 1;
	char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, _eof;
	#define Gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	inline void flush () { fwrite (obuf, 1, oS - obuf, stdout), oS = obuf; }
	inline void gc (char &x) { x = Gc(); }
	inline void pc (char x) { *oS ++ = x; if (oS == oT) flush (); }
	inline void pstr (const char *s) { int __len = strlen(s); for (__f = 0; __f < __len; ++__f) pc (s[__f]); }
	inline void gstr (char *s) { for(__c = Gc(); __c < 32 || __c > 126 || __c == ' ';)  __c = Gc();
		for(; __c > 31 && __c < 127 && __c != ' '; ++s, __c = Gc()) *s = __c; *s = 0; }
	template <class I> inline bool gi (I &x) { _eof = 0;
		for (__f = 1, __c = Gc(); (__c < '0' || __c > '9') && !_eof; __c = Gc()) { if (__c == '-') __f = -1; _eof |= __c == EOF; }
		for (x = 0; __c <= '9' && __c >= '0' && !_eof; __c = Gc()) x = x * 10 + (__c & 15), _eof |= __c == EOF; x *= __f; return !_eof; }
	template <class I> inline void print (I x) { if (!x) pc ('0'); if (x < 0) pc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10; while (qr) pc (qu[qr --]); }
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
} using io::pc; using io::gc; using io::pstr; using io::gstr; using io::gi; using io::print;

// end fast read template by CYJian

#define iter(i, a, b) for(int i=(a); i<(b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a)+1)
#define log(a) cerr<<"\033[32m[DEBUG] "<<#a<<'='<<(a)<<" @ line "<<__LINE__<<"\033[0m"<<endl
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
using ll=long long;
using pii=pair<int, int>;
//#define int ll
const int MOD = 1000000007;

char buf[5];
string seq[100005];
int n;
char ans[100005];

int dp[100005][4][4][4];
char dc[100005][4][4][4];

bool dfs(int i, int a, int b, int c) {
	if(a < 0 || b < 0 || c < 0) return 0;
	if(i == n) return 1;
	a = min(a, 3); b = min(b, 3); c = min(c, 3);
	if(dp[i][a][b][c] != -1) return dp[i][a][b][c];
	dp[i][a][b][c] = 0;
	if(seq[i] == "AB") {
		if(dfs(i+1, a+1, b-1, c)) { dc[i][a][b][c] = 'A'; return dp[i][a][b][c] = 1; } 
		else if(dfs(i+1, a-1, b+1, c)) { dc[i][a][b][c] = 'B'; return dp[i][a][b][c] = 1; } 
		else return 0;
	}
	if(seq[i] == "AC") {
		if(dfs(i+1, a+1, b, c-1)) { dc[i][a][b][c] = 'A'; return dp[i][a][b][c] = 1; } 
		else if(dfs(i+1, a-1, b, c+1)) { dc[i][a][b][c] = 'C'; return dp[i][a][b][c] = 1; } 
		else return 0;
	}
	if(seq[i] == "BC") {
		if(dfs(i+1, a, b+1, c-1)) { dc[i][a][b][c] = 'B'; return dp[i][a][b][c] = 1; } 
		else if(dfs(i+1, a, b-1, c+1)) { dc[i][a][b][c] = 'C'; return dp[i][a][b][c] = 1; } 
		else return 0;
	}
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
	gi(n);
	int a, b, c; gi(a), gi(b), gi(c);
	rep(i, n) {
		gstr(buf);
		seq[i] = buf;
	}
	memset(dp, -1, sizeof dp);
	if(!dfs(0, a, b, c)) pstr("No\n");
	else {
		pstr("Yes\n");
		a = min(a, 3), b = min(b, 3), c = min(c, 3);
		rep(i, n) {
			a = min(a, 3), b = min(b, 3), c = min(c, 3);
			char v = dc[i][a][b][c];
			pc(v), pc('\n');
			if(seq[i] == "AB") {
				if(v == 'A') a++, b--;
				else b++, a--;
			}
			if(seq[i] == "AC") {
				if(v == 'A') a++, c--;
				else c++, a--;
			}
			if(seq[i] == "BC") {
				if(v == 'B') b++, c--;
				else c++, b--;
			}
		}
	}
}

Measured memory_bytes: 47912