#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

vec<char> solve() {
    ll n, a, b, c;
    std::cin >> n >> a >> b >> c;
    vec<std::string> abc(n);
    for (auto &&e : abc) std::cin >> e;

    ll vl[] = { a, b, c, };

    vec<char> ret;
    vec<pll> idxv;
    for (auto &&e : abc) idxv.emplace_back(e[0] - 'A' ,e[1] - 'A');

    std::string ABC = "ABC";
    for (ll i = 0; i < n; i++) {
        auto [ i1, i2 ] = idxv[i];
        if (vl[i1] == 0 && vl[i2] == 0) return vec<char>();
        if (vl[i1] != vl[i2]) {
            if (vl[i1] > vl[i2]) std::swap(i1, i2);
        } else {
            if (i < n + 1) {
                auto [ n1, n2 ] = idxv[i + 1];
                bool a1 = (n1 == i1 || n2 == i1);
                if (!a1) std::swap(i1, i2);
            }
        }
        vl[i1]++;
        vl[i2]--;
        ret.push_back(ABC[i1]);
    }
    return ret;
}

int main() {
    auto ans = solve();
    if (ans.empty()) {
        std::cout << "No\n";
    } else {
        std::cout << "Yes\n";
        for (char c : ans) std::cout << c << "\n";
    }
    return 0;
}


Measured memory_bytes: 8460