#include <bits/stdc++.h>
// created [2020/05/05] 18:49:26
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
T in(const T offset) { return in<T>() - offset; }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T offset) { return in<T>(offset); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs, const T offset)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs, offset); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs, const T offset) { return in_v<T, Uint, n, 0>(szs, offset); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
template<typename... Types>
auto in_t(Types... offsets) { return std::tuple<std::decay_t<Types>...>{in<Types>(offsets)...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N   = in<int>();
    auto [A, B, C] = in_t<ll, ll, ll>();
    const auto ss  = in_v<std::string>({N});
    std::string ans;
    for (int i = 0; i < N; i++) {
        if (ss[i] == "AB") {
            if (A == 0 and B == 0) { return outln("No"); }
            if (A + B == 1) {
                if (A >= 1) {
                    ans.push_back('B');
                    A--, B++;
                } else {
                    ans.push_back('A');
                    A++, B--;
                }
                continue;
            }
            if (i == N - 1 or ss[i + 1] == ss[i]) {
                if (A >= 1) {
                    ans.push_back('B');
                    A--, B++;
                } else {
                    ans.push_back('A');
                    A++, B--;
                }
                continue;
            }
            if (C > 0) {
                if (A >= 1) {
                    ans.push_back('B');
                    A--, B++;
                } else {
                    ans.push_back('A');
                    A++, B--;
                }
                continue;
            }
            if (ss[i + 1] == "BC") {
                if (B == 1) {
                    if (A == 0) { return outln("No"); }
                    ans.push_back('B');
                    A--, B++;
                } else {
                    if (A >= 1) {
                        ans.push_back('B');
                        A--, B++;
                    } else {
                        ans.push_back('A');
                        A++, B--;
                    }
                }
            } else {
                if (A == 1) {
                    if (B == 0) { return outln("No"); }
                    ans.push_back('A');
                    A++, B--;
                } else {
                    if (A >= 1) {
                        ans.push_back('B');
                        A--, B++;
                    } else {
                        ans.push_back('A');
                        A++, B--;
                    }
                }
            }
        } else if (ss[i] == "BC") {
            if (B == 0 and C == 0) { return outln("No"); }
            if (B + C == 1) {
                if (B >= 1) {
                    ans.push_back('C');
                    B--, C++;
                } else {
                    ans.push_back('B');
                    B++, C--;
                }
                continue;
            }
            if (i == N - 1 or ss[i + 1] == ss[i]) {
                if (B >= 1) {
                    ans.push_back('C');
                    B--, C++;
                } else {
                    ans.push_back('B');
                    B++, C--;
                }
                continue;
            }
            if (A > 0) {
                if (B >= 1) {
                    ans.push_back('C');
                    B--, C++;
                } else {
                    ans.push_back('B');
                    B++, C--;
                }
                continue;
            }
            if (ss[i + 1] == "AC") {
                if (C == 1) {
                    if (B == 0) { return outln("No"); }
                    ans.push_back('C');
                    B--, C++;
                } else {
                    if (B >= 1) {
                        ans.push_back('C');
                        B--, C++;
                    } else {
                        ans.push_back('B');
                        B++, C--;
                    }
                }
            } else {
                if (B == 1) {
                    if (C == 0) { return outln("No"); }
                    ans.push_back('B');
                    B++, C--;
                } else {
                    if (B >= 1) {
                        ans.push_back('C');
                        B--, C++;
                    } else {
                        ans.push_back('B');
                        B++, C--;
                    }
                }
            }
        } else {
            if (C == 0 and A == 0) { return outln("No"); }
            if (C + A == 1) {
                if (C >= 1) {
                    ans.push_back('A');
                    C--, A++;
                } else {
                    ans.push_back('C');
                    C++, A--;
                }
                continue;
            }
            if (i == N - 1 or ss[i + 1] == ss[i]) {
                if (C >= 1) {
                    ans.push_back('A');
                    C--, A++;
                } else {
                    ans.push_back('C');
                    C++, A--;
                }
                continue;
            }
            if (B > 0) {
                if (C >= 1) {
                    ans.push_back('A');
                    C--, A++;
                } else {
                    ans.push_back('C');
                    C++, A--;
                }
                continue;
            }
            if (ss[i + 1] == "AB") {
                if (A == 1) {
                    if (C == 0) { return outln("No"); }
                    ans.push_back('A');
                    C--, A++;
                } else {
                    if (C >= 1) {
                        ans.push_back('A');
                        C--, A++;
                    } else {
                        ans.push_back('C');
                        C++, A--;
                    }
                }
            } else {
                if (C == 1) {
                    if (A == 0) { return outln("No"); }
                    ans.push_back('C');
                    C++, A--;
                } else {
                    if (C >= 1) {
                        ans.push_back('A');
                        C--, A++;
                    } else {
                        ans.push_back('C');
                        C++, A--;
                    }
                }
            }
        }
    }
    outln("Yes");
    for (const char c : ans) { outln(c); }
    return 0;
}


Measured memory_bytes: 6676