#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
#define int long long
const int INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T>
inline void chmax(T &a, const T &b) {
    if ((a) < (b)) (a) = (b);
}
template <class T>
inline void chmin(T &a, const T &b) {
    if ((a) > (b)) (a) = (b);
}

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)    \
    sort(all(x)); \
    x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
    Fast() {
        std::cin.tie(0);
        ios::sync_with_stdio(false);
    }
} fast;
void check_input() {
    assert(cin.eof() == 0);
    int tmp;
    cin >> tmp;
    assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"

signed main() {
    //input
    int n;cin>>n;
    dump(n);
    vi x(3);
    cin>>x[0]>>x[1]>>x[2];

    //solve
    vector<string> s(n);
    string ans = "";
    vvi nex(3, vi(n, INF));
    vi last(3, -1);
    rep(i, n){
        cin>>s[i];
        vi idx(2);
        rep(j, 2) idx[j] = s[i][j]-'A';

        rep(j, 2){
            if (last[idx[j]]!=-1) nex[idx[j]][last[idx[j]]] = i;
            last[idx[j]] = i;
        }
    }
    dump(nex[0]);
    dump(nex[1]);
    dump(nex[2]);

    rep(i, n){
        cerrendl;
        dump(s[i]);
        vi idx(2);
        rep(j, 2) idx[j] = s[i][j] - 'A';

        dump(idx[0], idx[1]);

        if (x[idx[0]]==0 && x[idx[1]]==0){
            cout << "No" << endl;
            return 0;
        }

        auto addr = [&](){
            ans += 'A'+idx[1];
            x[idx[0]]--;x[idx[1]]++;
        };
        auto addl = [&](){
            ans += 'A'+idx[0];
            x[idx[0]]++;x[idx[1]]--;
        };
        if (x[idx[0]]==x[idx[1]]){
            int ja = nex[idx[0]][i];
            int jb = nex[idx[1]][i];
            if (ja<jb){ addl(); }
            else{ addr(); }
        }
        else if (x[idx[0]]<x[idx[1]]){
            addl();
        }
        else{
            addr();
        }
    }
    cout << "Yes" << endl;
    rep(i, sz(ans)){
        cout << ans[i] << endl;
    }

    return 0; 
}


Measured memory_bytes: 9544