#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>


using namespace std;

#define REP(i, n) for(int i = 0;i < (n);++i)
#define REPR(i, n) for(int i = n-1;i >= 0;--i)
#define FOR(i, m, n) for(int i = m;i < n;++i)
#define FORR(i, m, n) for(int i = m-1;i >= n;--i)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout<<(x)<<'\n'
#define pe(x) cout<<(x)<<" "
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define lb(v,n) lower_bound(v.begin(), v.end(), (n))
#define ub(v,n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int>pii;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7; constexpr int MAX = 200020;
const double pi = acos(-1); constexpr double EPS = 1e-8;
constexpr ll INF = 1e16;
void yes(bool c) { if (c)print("Yes"); else print("No"); };


int A[3];
bool over(int id, int val) {
	return A[id] + A[(id + 1) % 3] > 1;
}
void solve() {
	int N; cin >> N;
	REP(i, 3)cin >> A[i];
	deque<pii>deq;
	vector<int>v;
	REP(i, N) {
		string s; cin >> s;
		int num = 0;
		if (s == "AB")num = 0;
		else if (s == "BC")num = 1;
		else num = 2;
		if (deq.empty()) {
			deq.push_back({ num,1 });
		}
		else {
			pii p = deq.back();
			if (p.first == num) {
				deq.pop_back();
				p.second++;
				deq.push_back(p);
			}
			else {
				deq.push_back({ num,1 });
			}
		}
	}
	deq.push_back({ 0,0 });
	vector<int>ans;
	while (!deq.empty()) {
		pii p = deq.front();
		deq.pop_front();
		if (p.second == 0)break;
		int id = p.first;
		//pe(id); print(p.second);
		//pe(A[id]); print(A[(id + 1) % 3]);
		if (A[id] + A[(id + 1) % 3] == 0) {
			print("No"); return;
		}
		REP(_, p.second) {
			if (A[id] < 0 || A[(id + 1) % 3] < 0) {
				print("No"); return;
			}
			pii np = deq.front();
			int nxt = np.first;
			if (!over(nxt,np.second)) {
				if (id == (nxt+1)%3) {
					if (A[(id + 1) % 3]) {
						A[id]++;
						A[(id + 1) % 3]--;
						ans.push_back(id);
					}
					else {
						A[id]--;
						A[(id + 1) % 3]++;
						ans.push_back((id + 1) % 3);
					}
				}
				else if (((id + 1) == nxt + 1 || (id + 1) % 3 == nxt)) {
					if (A[id]) {
						A[id]--;
						A[(id + 1) % 3]++;
						ans.push_back((id + 1) % 3);
					}
					else {

						A[id]++;
						A[(id + 1) % 3]--;
						ans.push_back(id);
					}
				}
			}
			else {
				int other = (nxt + 2) % 3;
				if (id == other) {
					if (A[(id + 1) % 3]) {
						A[id]++;
						A[(id + 1) % 3]--;
						ans.push_back(id);
					}
					else {
						A[id]--;
						A[(id + 1) % 3]++;
						ans.push_back((id + 1) % 3);
					}
				}
				else {
					if (A[id]) {
						A[id]--;
						A[(id + 1) % 3]++;
						ans.push_back((id + 1) % 3);
					}
					else {
						A[id]++;
						A[(id + 1) % 3]--;
						ans.push_back(id);
					}
				}
			}
		}
	}
	print("Yes");
	REP(i, ans.size()) {
		if (ans[i] == 0)print("A");
		else if (ans[i] == 1)print("B");
		else print("C");
	}
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q; cin >> q;
	//while (q--)
	solve();
}



Measured memory_bytes: 5396