#include <bits/stdc++.h>

using namespace std;

//using ll = int64_t;
using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = double;

#define X first
#define Y second

#ifndef ONLINE_JUDGE
#define FWRITE
#endif

namespace io
{

#ifndef FWRITE
#include <unistd.h>
#endif
	const int BUFSIZE = 1 << 20;

	int isize, osize;
	char ibuf[BUFSIZE + 10], obuf[BUFSIZE + 10];
	char* is, * it, * os = obuf, * ot = obuf + BUFSIZE;

	char getchar()
	{
		if (is == it)
		{
			is = ibuf;
#ifdef FWRITE
			it = ibuf + fread(ibuf, 1, BUFSIZE, stdin);
#else
			it = ibuf + read(STDIN_FILENO, ibuf, BUFSIZE);
#endif
			if (is == it) return EOF;
		}
		return *is++;
	}

	char getalpha()
	{
		char c = getchar();
		while (!isalpha(c)) c = getchar();
		return c;
	}

	void putchar(char c)
	{
		*os++ = c;
		if (os == ot)
		{
#ifdef FWRITE
			fwrite(obuf, 1, BUFSIZE, stdout);
#else
			write(STDOUT_FILENO, obuf, BUFSIZE);
#endif
			os = obuf;
		}
	}

	int inp() {
		int x = 0, f = 0; char ch;
		for (ch = getchar(); !isdigit(ch); ch = getchar())
		{
			if (ch == EOF) return -1;
			if (ch == '-') f = 1;
		}
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return f ? -x : x;
	}

	ll inp_ll() {
		ll x = 0; int f = 0; char ch;
		for (ch = getchar(); !isdigit(ch); ch = getchar())
			if (ch == '-') f = 1;
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return f ? -x : x;
	}

	template<class T>
	bool read(T& x)
	{
		x = 0;
		char ch = getchar();
		if (ch == EOF) return 0;
		for (; !isdigit(ch); )
		{
			ch = getchar();
			if (ch == EOF) return 0;
		}
		for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return 1;
	}

	template<class T>
	void write(T x)
	{
		static char s[22];
		static char* it = s + 20;
		static char* end = s + 20;

		if (x < 0)
		{
			putchar('-');
			x = -x;
		}

		do
		{
			*--it = x % 10 + '0';
			x /= 10;
		} while (x);
		/*
		if (!x)
			*-- it = '0';
		while (x)
		{
			*-- it = x%10+'0';
			x /= 10;
		}
		*/
		for (; it < end; ++it)
			putchar(*it);
	}

	template<>
	void write(const char* s)
	{
		for (; *s; ++s) putchar(*s);
	}

	template<>
	void write(char c)
	{
		putchar(c);
	}

	template<class T, class V>
	void write(T x, V y)
	{
		write(x);
		write(y);
	}

	template<class T>
	void writeln(T x)
	{
		write(x);
		putchar('\n');
	}

	struct ender
	{
		~ender()
		{
			if (os != obuf)
#ifdef FWRITE
				fwrite(obuf, 1, os - obuf, stdout);
#else
				write(STDOUT_FILENO, obuf, os - obuf);
#endif
		}
	}__ender;

}

template<class T>
void print(const T& a)
{
	for (auto x : a) printf("%d ", x); puts("");
}

int64_t power(int64_t a, int64_t b, int64_t p)
{
	if (!b) return 1;
	int64_t t = power(a, b >> 1, p);
	t = t * t % p;
	if (b & 1) t = t * a % p;
	return t;
}

//mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

using namespace io;

template<class T>
inline void freshmin(T& a, const T& b)
{
	if (a > b) a = b;
}

template<class T>
inline void freshmax(T& a, const T& b)
{
	if (a < b) a = b;
}

const ll B = 31;
//const ll MOD = 998244353;
const int INF = 1000000010;
const ll INFll = 1000000000000000000LL;
const int MAXN = 100010;

int dx[] = { -1, 1, 0, 0, -1, -1, 1, 1 };
int dy[] = { 0, 0, -1, 1, -1, 1, -1, 1 };

ld det(ld x1, ld y1, ld x2, ld y2, ld x3, ld y3)
{
	return x1 * y2 - x2 * y1 + x2 * y3 - x3 * y2 + x3 * y1 - x1 * y3;
}

int n, a, b, c;
int f[MAXN][5][5][5];
tuple<int, int, int, int> g[MAXN][5][5][5];
char s[MAXN][5];

const int K = 4;

void go(int n, int a, int b, int c)
{
	if (n == 0) return;
	auto [op, ta, tb, tc] = g[n][a][b][c];
	go(n - 1, ta, tb, tc);
	printf("%c\n", op + 'A');
}

void solve()
{
	scanf("%d%d%d%d", &n, &a, &b, &c);
	a = min(a, K);
	b = min(b, K);
	c = min(c, K);
	f[0][a][b][c] = 1;
	for (int i = 1; i <= n; ++i)
	{
		scanf("%s", s[i]);
		string tmp = s[i];
		if (tmp == "AB")
		{
			for (int a = 0; a <= K; ++ a)
				for (int b = 0; b <= K; ++ b)
					for (int c = 0; c <= K; ++c)
					{
						if (!f[i - 1][a][b][c]) continue;
						if (b - 1 >= 0) f[i][min(a + 1, K)][b - 1][c] = 1, g[i][min(a + 1, K)][b - 1][c] = { 0, a, b, c };
						if (a - 1 >= 0) f[i][a - 1][min(b + 1, K)][c] = 1, g[i][a - 1][min(b + 1, K)][c] = { 1, a, b, c };
					}
		}
		else if (tmp == "AC")
		{
			for (int a = 0; a <= K; ++a)
				for (int b = 0; b <= K; ++b)
					for (int c = 0; c <= K; ++c)
					{
						if (!f[i - 1][a][b][c]) continue;
						if (c - 1 >= 0) f[i][min(a + 1, K)][b][c - 1] = 1, g[i][min(a + 1, K)][b][c - 1] = { 0, a, b, c };
						if (a - 1 >= 0) f[i][a - 1][b][min(c + 1, K)] = 1, g[i][a - 1][b][min(c + 1, K)] = { 2, a, b, c };
					}
		}
		else
		{
			for (int a = 0; a <= K; ++a)
				for (int b = 0; b <= K; ++b)
					for (int c = 0; c <= K; ++c)
					{
						if (!f[i - 1][a][b][c]) continue;
						if (c - 1 >= 0) f[i][a][min(b + 1, K)][c - 1] = 1, g[i][a][min(b + 1, K)][c - 1] = { 1, a, b, c };
						if (b - 1 >= 0) f[i][a][b - 1][min(c + 1, K)] = 1, g[i][a][b - 1][min(c + 1, K)] = { 2, a, b, c };
					}
		}
	}
	for (int a = 0; a <= K; ++a)
		for (int b = 0; b <= K; ++b)
			for (int c = 0; c <= K; ++c)
				if (f[n][a][b][c])
				{
					puts("Yes");
					go(n, a, b, c);
					return;
				}
	puts("No");
}

int main()
{

	//for (int T = inp(); T --; )
	solve();

	return 0;
}

Measured memory_bytes: 250036