#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N, A, B, C;
vector<char> ret;

void dame()
{
    puts("No");
    exit(0);
}

void do_ab()
{
    if (B > 1) ret.emplace_back('A'), A++, B--;
    else if (A > 1) ret.emplace_back('B'), B++, A--;
    else if (B) ret.emplace_back('A'), A++, B--;
    else ret.emplace_back('B'), B++, A--;
}

void do_bc()
{
    if (C > 1) ret.emplace_back('B'), B++, C--;
    else if (B > 1) ret.emplace_back('C'), C++, B--;
    else if (C) ret.emplace_back('B'), B++, C--;
    else ret.emplace_back('C'), C++, B--;
}

void do_ac()
{
    if (C > 1) ret.emplace_back('A'), A++, C--;
    else if (A > 1) ret.emplace_back('C'), C++, A--;
    else if (C) ret.emplace_back('A'), A++, C--;
    else ret.emplace_back('C'), C++, A--;
}

int main()
{
    cin >> N >> A >> B >> C;
    vector<string> Q(N);
    cin >> Q;
    REP(i, N)
    {
        if (Q[i] == "AB" and !A and !B) dame();
        if (Q[i] == "BC" and !B and !C) dame();
        if (Q[i] == "AC" and !A and !C) dame();

        if (Q[i] == "AB")
        {
            if (A == 1 and B == 1 and i < N - 1)
            {
                if (Q[i + 1] == Q[i]) do_ab();
                else
                {
                    if (Q[i + 1] == "BC")
                    {
                        ret.emplace_back('B');
                        B++, A--;
                    }
                    else
                    {
                        ret.emplace_back('A');
                        A++, B--;
                    }
                }
            }
            else do_ab();
        }
        if (Q[i] == "BC")
        {
            if (B == 1 and C == 1 and i < N - 1)
            {
                if (Q[i + 1] == Q[i]) do_bc();
                else
                {
                    if (Q[i + 1] == "AC")
                    {
                        ret.emplace_back('C');
                        C++, B--;
                    }
                    else
                    {
                        ret.emplace_back('B');
                        B++, C--;
                    }
                }
            }
            else do_bc();
        }
        if (Q[i] == "AC")
        {
            if (A == 1 and C == 1 and i < N - 1)
            {
                if (Q[i + 1] == Q[i]) do_ac();
                else
                {
                    if (Q[i + 1] == "BC")
                    {
                        ret.emplace_back('C');
                        C++, A--;
                    }
                    else
                    {
                        ret.emplace_back('A');
                        A++, C--;
                    }
                }
            }
            else do_ac();
        }
    }
    cout << "Yes\n";
    for (auto x : ret) cout << x << '\n';
}


Measured memory_bytes: 6704