#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, A, B, C; cin >> N >> A >> B >> C;
    vec<lint> state = {A, B, C};
    vec<plint> queries(N);
    range(i, 0, N) {
        string op; cin >> op;
        if (op == "AB") queries.at(i) = {0, 1};
        else if (op == "BC") queries.at(i) = {1, 2};
        else queries.at(i) = {0, 2};
    }
    vec<lint> conducuted_op(N, -1);
    auto apply_op = [&](lint k, lint i, lint j) {
        state.at(i) += 1;
        state.at(j) -= 1;
        conducuted_op.at(k) = i;
    };
    range(k, 0, N) {
        lint i, j; tie(i, j) = queries.at(k);
        lint other = 3 - i - j;
        if (state.at(i) == 0 and state.at(j) == 0) {
            cout << "No" << "\n";
            return 0;
        }
        else if (state.at(i) == 0) apply_op(k, i, j);
        else if (state.at(j) == 0) apply_op(k, j, i);
        else if (state.at(i) == 1 and state.at(j) == 1) {
            if (k != N - 1 and state.at(other) == 0) {
                lint ni, nj; tie(ni, nj) = queries.at(k + 1);
                if (ni == i and nj == j) apply_op(k, i, j);
                else if (ni == i or nj == i) apply_op(k, i, j);
                else apply_op(k, j, i);
            }
            else apply_op(k, i, j);
        }
        else {
            if (state.at(i) >= state.at(j)) apply_op(k, j, i);
            else apply_op(k, i, j);
        }
    }
    cout << "Yes" << '\n';
    range(i, 0, N) cout << (char)('A' + conducuted_op.at(i)) << '\n';
}

Measured memory_bytes: 5576