// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

#define mt make_tuple

int32_t main() {
    int n,a,b,c; cin >> n >> a >> b >> c;
    vector<string> s(n); cin >> s;

    if (a+b+c == 2) {
        using Array = array<int,3>;
        using Set = set<Array>;
        Set st = {{a,b,c}};
        vector<map<Array,Array>> pre(n);
        rep (i,n) {
            for (auto t : st) {
                auto old = t;
                int &x = t[s[i][0]-'A'], &y = t[s[i][1]-'A'];
                if (x == 0 && y == 0) continue;
                else if (x == 0 && y == 1) ++x,--y, pre[i][t] = old;
                else if (x == 1 && y == 0) --x,++y, pre[i][t] = old;
                else if (x == 0 && y == 2) ++x,--y, pre[i][t] = old;
                else if (x == 2 && y == 0) --x,++y, pre[i][t] = old;
                else if (x == 1 && y == 1) {
                    x = 0, y = 2, pre[i][t] = old;
                    x = 2, y = 0, pre[i][t] = old;
                }
            }
            st.clear();
            for (auto p : pre[i]) st.insert(p.fst);
            if (st.empty()) quit("No");
        }

        vector<array<int,3>> v;
        v.eb(*st.begin());
        repR (i,n) {
            assert(pre[i].count(v.back()));
            v.eb(pre[i][v.back()]);
        }
        reverse(all(v));
        dump(as_mat(v));
        cout << "Yes" << endl;
        rep (i,n) {
            rep (j,3) if (v[i][j]+1 == v[i+1][j]) cout << char('A'+j) << "\n";
        }

        return 0;
    }

    auto f = [&](int &x, int &y) {
        int choice = -1;
        if (x > y) --x, ++y, choice = 1;
        else ++x, --y, choice = 0;
        if (x < 0 || y < 0) quit("No");
        return choice;
    };

    vector<char> ans;
    rep (i,n) {
        if (s[i] == "AB") ans.eb(s[i][f(a,b)]);
        if (s[i] == "AC") ans.eb(s[i][f(a,c)]);
        if (s[i] == "BC") ans.eb(s[i][f(b,c)]);
    }

    cout << "Yes" << endl;
    rep (i,n) cout << ans[i] << "\n";
}


Measured memory_bytes: 25928