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

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

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

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

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

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(auto &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

void _debug_print(auto x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

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

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

ll f_total(ll type, ll a, ll b, ll c)
{
    if (type == 0) return a + b;
    if (type == 1) return a + c;
    if (type == 2) return b + c;
}

void f_single(V<char> &anslist, ll type, ll cnt, ll &a, ll &b, ll &c)
{
    rep (i, cnt) {
        if (type == 0) {
            if (b) {a++; b--; anslist.pb('A'); }
            else {a--; b++; anslist.pb('B'); }
        }
        if (type == 1) {
            if (c) {a++; c--; anslist.pb('A'); }
            else {a--; c++; anslist.pb('C'); }
        }
        if (type == 2) {
            if (c) {b++; c--; anslist.pb('B'); }
            else {b--; c++; anslist.pb('C'); }
        }
    }
}

void f_multi(V<char> &anslist, ll type, ll cnt, char nh, ll &a, ll &b, ll &c)
{
    rep (i, cnt) {
        if (type == 0) {
            if (!a) { a++; b--; anslist.pb('A'); }
            else if (!b) { a--; b++; anslist.pb('B'); }
            else if (nh == 'A') { a++; b--; anslist.pb('A'); }
            else { a--; b++; anslist.pb('B'); }
        }
        if (type == 1) {
            if (!a) { a++; c--; anslist.pb('A'); }
            else if (!c) { a--; c++; anslist.pb('C'); }
            else if (nh == 'A') { a++; c--; anslist.pb('A'); }
            else { a--; c++; anslist.pb('C'); }
        }
        if (type == 2) {
            if (!b) { b++; c--; anslist.pb('B'); }
            else if (!c) { b--; c++; anslist.pb('C'); }
            else if (nh == 'B') { b++; c--; anslist.pb('B'); }
            else { b--; c++; anslist.pb('C'); }
        }
    }
}

void _main()
{
    ll n; llin(n);
    ll a; llin(a);
    ll b; llin(b);
    ll c; llin(c);
    V<string> slist;
    rep (i,n) {
        string tmp; CIN(tmp);
        slist.pb(tmp);
    }
    slist.pb("xxx");

    V<t2> ops;
    ll cnt = 0;
    string prev = "_";
    for (auto s : slist) {

        ll op = -1;
        if (prev == "AB") op = 0;
        if (prev == "AC") op = 1;
        if (prev == "BC") op = 2;

        if (s != prev) {
            if (op >= 0) ops.pb(t2(op, cnt));
            cnt = 1;
        }
        else {
            cnt++;
        }
        prev = s;
    }

    debug_printf("---- ops\n");
    debug_print(ops);

    V<char> anslist;

    rep (i, ops.size()) {
        ll type = get<0>(ops[i]);
        ll cnt = get<1>(ops[i]);
        ll total = f_total(type, a, b, c);

        if (total == 0) {
            cout << "No" << endl;
            return;
        }
        if (total == 1) {
            f_single(anslist, type, cnt, a, b, c);
        }
        if (total >= 2) {
            char nh = '*';
            if (i+1 < ops.size()) {
                ll ntype = get<0>(ops[i+1]);
                if (type == 0 && ntype == 1) nh = 'A';
                if (type == 0 && ntype == 2) nh = 'B';
                if (type == 1 && ntype == 0) nh = 'A';
                if (type == 1 && ntype == 2) nh = 'C';
                if (type == 2 && ntype == 0) nh = 'B';
                if (type == 2 && ntype == 1) nh = 'C';
            }
            else {
                if (type == 0) nh = 'A';
                if (type == 1) nh = 'A';
                if (type == 2) nh = 'B';
            }
            f_multi(anslist, type, cnt, nh, a, b, c);
        }
    }

    cout << "Yes" << endl;
    for (auto c : anslist) cout << c << endl;
}

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


Measured memory_bytes: 9492