import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

void main()
{
	auto N = RD;
	auto A = RD;
	auto B = RD;
	auto C = RD;
	auto s = new string[](N);
	foreach (i; 0..N)
	{
		s[i] = RD!string;
	}

	long[] getPos(string str)
	{
		if (str == "AB")
			return [0, 1];
		else if (str == "AC")
			return [0, 2];
		else
			return [1, 2];
	}

	bool[long[]] set;
	set[[0, 0, 0]] = true;
	foreach_reverse (i; 0..N)
	{
		auto pos = getPos(s[i]);
		long p1 = pos[0], p2 = pos[1];

		bool[long[]] nSet;
		foreach (key; set.keys)
		{
			{
				auto nKey = key.dup;
				++nKey[p1];
				nKey[p2] = max(0, nKey[p2]-1);
				nSet[nKey.idup] = true;
			}
			{
				auto nKey = key.dup;
				++nKey[p2];
				nKey[p1] = max(0, nKey[p1]-1);
				nSet[nKey.idup] = true;
			}
		}
		set = nSet;
	}
	debug writeln(set);

	string STR = "ABC";
	bool ok;
	string ans;
	foreach (key; set.keys)
	{
		if (key[0] <= A && key[1] <= B && key[2] <= C)
		{
			ok = true;
			string dfs(long[] arr, long i, string str)
			{
				if (i == N) return str;

				auto pos = getPos(s[i]);
				long p1 = pos[0], p2 = pos[1];
				string res;
				if (arr[p1] != 0)
				{
					auto nArr = arr.dup;
					--nArr[p1];
					++nArr[p2];
					res = dfs(nArr, i+1, str ~ STR[p2]);
				}
				if (!res.empty) return res;
				if (arr[p2] != 0)
				{
					auto nArr = arr.dup;
					--nArr[p2];
					++nArr[p1];
					res = dfs(nArr, i+1, str ~ STR[p1]);
				}
				return res;
			}
			ans = dfs(key.dup, 0, "");
			break;
		}
	}

	if (ok)
	{
		writeln("Yes");
		foreach (e; ans)
		{
			writeln([e]);
		}
	}
	else
		writeln("No");
	stdout.flush;
	debug readln;
}