/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int n, a, b, c; cin >> n >> a >> b >> c;
    vector<string> s(n);
    rep(i, n) {
        cin >> s[i];
    }
    vector<char> ans(n);
    rep(i, n) {
        if((a == 0 && b == 0 && s[i] == "AB") || (b == 0 && c == 0 && s[i] == "BC") || (c == 0 && a == 0 && s[i] == "AC")) {
            cout << "No" << endl;
            return;
        }
        if(s[i] == "AB") {
            bool A;
            if(a > b) {
                A = 0;
            } else if(a < b) {
                A = 1;
            } else {
                if(i == n - 1) {
                    A = 1;
                } else {
                    if(s[i + 1] == "AB") A = 1;
                    else if(s[i + 1] == "BC") A = 0;
                    else A = 1;
                }
            }
            if(A) {
                ans[i] = 'A';
                ++ a, --b;
            } else {
                ans[i] = 'B';
                -- a, ++ b;
            }
        } else if(s[i] == "AC") {
            bool A;
            if(a > c) {
                A = 0;
            } else if(a < c) {
                A = 1;
            } else {
                if(i == n - 1) {
                    A = 1;
                } else {
                    if(s[i + 1] == "AC") A = 1;
                    else if(s[i + 1] == "BC") A = 0;
                    else A = 1;
                }
            }
            if(A) {
                ans[i] = 'A';
                ++ a, --c;
            } else {
                ans[i] = 'C';
                -- a, ++ c;
            }
        } else {
            //BC
            bool B;
            if(b > c) {
                B = 0;
            } else if(b < c) {
                B = 1;
            } else {
                if(i == n - 1) {
                    B = 1;
                } else {
                    if(s[i + 1] == "BC") B = 1;
                    else if(s[i + 1] == "AC") B = 0;
                    else B = 1;
                }
            }
            if(B) {
                ans[i] = 'B';
                ++ b, --c;
            } else {
                ans[i] = 'C';
                -- b, ++ c;
            }
        }
    }
    cout << "Yes" << endl;
    rep(i, n) {
        cout << ans[i] << endl;
    }
}

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

Measured memory_bytes: 6668