#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

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




void solve() {
	int n, c[3];
	cin >> n;
	rep(i, 3)cin >> c[i];
	int tmp = 0;
	rep(i, 3)if (c[i] > 0)tmp++;

	vector<string> s(n);
	rep(i, n)cin >> s[i];
	/*if (tmp != 2) {
		vector<char> ans(n);
		rep(i, n) {
			vector<int> id;
			rep(j, 2)id.push_back(s[i][j] - 'A');
			if (c[id[0]] > c[id[1]]) {
				c[id[0]]--; c[id[1]]++;
				if (c[id[0]] < 0) {
					cout << "No\n"; return;
				}
				ans[i] = 'A' + id[1];
			}
			else {
				c[id[0]]++; c[id[1]]--;
				if (c[id[1]] < 0) {
					cout << "No\n"; return;
				}
				ans[i] = 'A' + id[0];
			}
		}
		cout << "Yes\n";
		rep(i, n)cout << ans[i] << "\n";
	}
	else {
		vector<char> ans(n);
		rep(i, n) {

		}
	}*/
	vector<char> ans(n);
	rep(i, n) {
		vector<int> id;
		rep(j, 2)id.push_back(s[i][j] - 'A');
		if (c[id[0]] == 1 && c[id[1]] == 1) {
			string t0;
			t0.push_back('A' + id[0]);
			t0.push_back('A' + 3 - id[0] - id[1]);
			sort(all(t0));
			string t1;
			t1.push_back('A' + id[1]);
			t1.push_back('A' + 3 - id[0] - id[1]);
			sort(all(t1));
			if (i + 1 < n&&s[i+1] == t0) {
				c[id[0]]++; c[id[1]]--;
				ans[i]='A' + id[0];
			}
			else {
				c[id[1]]++; c[id[0]]--;
				ans[i]='A' + id[1];
			}
		}
		else if (c[id[0]] > c[id[1]]) {
			c[id[0]]--; c[id[1]]++;
			if (c[id[0]] < 0) {
				cout << "No\n"; return;
			}
			ans[i] = 'A' + id[1];
		}
		else {
			c[id[0]]++; c[id[1]]--;
			if (c[id[1]] < 0) {
				cout << "No\n"; return;
			}
			ans[i] = 'A' + id[0];
		}
	}
	cout << "Yes\n";
	rep(i, n)cout << ans[i] << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	//experi();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}

Measured memory_bytes: 10572