#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
    for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
    for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define VREP(s, ite) for (auto ite = s.begin(); ite != s.end(); ++ite)
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
//#define endl "\n"
#define ciosup  \
    cin.tie(0); \
    ios::sync_with_stdio(false);
#define eb emplace_back
#define vint vector<int>
constexpr ll INF = 1e15 + 7LL;
constexpr ll MOD = 1e9 + 7LL;

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

int main() {
    ll n,a,b,c;
    cin >> n >> a >> b >> c;
    vll nums{a, b, c};
    map<char, int> inds{{'A', 0}, {'B', 1}, {'C', 2}};
    vector<string> S(n);
    REP(i, n) {
        cin >> S[i];
    }
    vector<char> ans;
    REP(i, n) {
        string now = S[i];
        if (i == n - 1){
            if (nums[inds[now[0]]] == 0 && nums[inds[now[1]]] == 0){
                cout << "No" << endl;
                return 0;
            } else if (nums[inds[now[0]]] > 0) {
                ans.push_back(now[1]);
            }else{
                ans.push_back(now[0]);
            }
        } else {
            if (nums[inds[now[0]]] == 0 && nums[inds[now[1]]] == 0) {
                cout << "No" << endl;
                return 0;
            } else if (nums[inds[now[0]]] == 0) {
                ans.push_back(now[0]);
                nums[inds[now[0]]]++;
                nums[inds[now[1]]]--;
            } else if (nums[inds[now[1]]] == 0) {
                ans.push_back(now[1]);
                nums[inds[now[1]]]++;
                nums[inds[now[0]]]--;
            } else if (nums[inds[now[0]]] == 1 && nums[inds[now[1]]] > 1) {
                ans.push_back(now[0]);
                nums[inds[now[0]]]++;
                nums[inds[now[1]]]--;
            } else if (nums[inds[now[0]]] > 1 && nums[inds[now[1]]] == 1) {
                ans.push_back(now[1]);
                nums[inds[now[1]]]++;
                nums[inds[now[0]]]--;
            } else if (nums[inds[now[0]]] == 1 && nums[inds[now[1]]] == 1){
                string next = S[i+1];
                if (next[0] == now[0] || next[1] == now[0]) {
                    ans.push_back(now[0]);
                    nums[inds[now[0]]]++;
                    nums[inds[now[1]]]--;
                } else {
                    ans.push_back(now[1]);
                    nums[inds[now[1]]]++;
                    nums[inds[now[0]]]--;
                }
            } else {
                ans.push_back(now[0]);
                nums[inds[now[0]]]++;
                nums[inds[now[1]]]--;
            }
        }
    }
    cout << "Yes" << endl;
    REP(i, n) { cout << ans[i] << endl; }
}


Measured memory_bytes: 6740