#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

ll POW(ll n, ll p) {
    ll ret = 1;
    FOR(i, 0, p)ret *= n;
    return ret;
}

int main() {
    init();

    int n, a, b, c; cin >> n >> a >> b >> c;
    VS s(n); cin >> s;
    VS ans(n, "");
    queue<int> x, y, z;
    FOR(i, 0, n) {
        if (s[i] == "AB") {
            --a, --b;
            x.push(i), y.push(i);
        }
        if (s[i] == "AC") {
            --a, --c;
            x.push(i), z.push(i);
        }
        if (s[i] == "BC") {
            --b, --c;
            y.push(i), z.push(i);
        }

        while (a < 0) {
            if (x.empty()) {
                cout << "No\n";
                return 0;
            }
            int j = x.front();
            x.pop();
            if (ans[j] != "")continue;
            ans[j] = "A";
            a += 2;
        }
        while (b < 0) {
            if (y.empty()) {
                cout << "No\n";
                return 0;
            }
            int j = y.front();
            y.pop();
            if (ans[j] != "")continue;
            ans[j] = "B";
            b += 2;
        }
        while (c < 0) {
            if (z.empty()) {
                cout << "No\n";
                return 0;
            }
            int j = z.front();
            z.pop();
            if (ans[j] != "")continue;
            ans[j] = "C";
            c += 2;
        }
    }

    while (!x.empty()) {
        int j = x.front();
        x.pop();
        if (ans[j] == "")ans[j] = "A";
    }
    while (!y.empty()) {
        int j = y.front();
        y.pop();
        if (ans[j] == "")ans[j] = "B";
    }
    while (!z.empty()) {
        int j = z.front();
        z.pop();
        if (ans[j] == "")ans[j] = "C";
    }

    cout << "Yes\n";
    each(i, ans)cout << i << "\n";
}


Measured memory_bytes: 10352