#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////


int main() {
	ll N;
	cin >> N;
	ll A[3];
	rep(j, 3) cin >> A[j];

	ll K = A[0] + A[1] + A[2];

	vector<ll> s(N+1);
	repn(i, N) {
		string c;
		cin >> c;
		if (c == "AB") { s[i] = 2; }
		if (c == "AC") { s[i] = 1; }
		if (c == "BC") { s[i] = 0; }

	}

	vector<char> ans(N+1);
	string yesno = "Yes";

	repn(i, N) {
		ll x = (s[i] + 1) % 3;
		ll y = (s[i] + 2) % 3;
		ll a = A[x];
		ll b = A[y];

		//cout << x << y << endl;
		if (K == 0) {
			yesno = "No";
			break;
		}


		else if (K == 1) {
			if (a > 0) { ans[i] = y;}
			else if (b > 0) {ans[i] = x;}
			else { yesno = "No"; break; }
		}

		else if (K == 2) {
			if (a > 0 && b > 0) {
				if (i < N&&s[i + 1] == x) { ans[i] = y;}
				else { ans[i] = x;}
			}
			else if (a > 0) { ans[i] = y; }
			else if (b > 0) { ans[i] = x; }
			else { yesno = "No"; break; }
		}

		else {
			if (a > 1) { ans[i] = y; }
			else if (a == 1 && b == 0) { ans[i] = y; }
			else if (b > 0) { ans[i] = x; }
			else { yesno = "No"; break; }
		}

		if (ans[i] == x) { A[x]++; A[y]--; }
		else { A[y]++; A[x]--; }

		//cout << A[0] << A[1] << A[2] << endl;

	}



	cout << yesno << endl;
	if (yesno == "Yes") {
		repn(i, N) {
			if (ans[i] == 0) { cout << "A" << endl; }
			if (ans[i] == 1) { cout << "B" << endl; }
			if (ans[i] == 2) { cout << "C" << endl; }

		}
	}
	
	system("PAUSE");
}


Measured memory_bytes: 4372