#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr long double PI = 3.1415926535897932384626433832795028L;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int N, A, B, C;
string s[110000];
signed main() {
    cin >> N >> A >> B >> C;
    rep(i, N) { cin >> s[i]; }
    vector<char> ans;
    rep(i, N) {
        if (s[i] == "AB") {
            if (A == 0 && B == 0) { fin("No"); }
            if (A == 1 && B == 1 && i != N - 1) {
                if (s[i + 1] == "BC") { A--, B++, ans.push_back('B'); }
                else { A++, B--, ans.push_back('A'); }
            } else if (A > B) { A--, B++, ans.push_back('B'); }
            else { A++, B--, ans.push_back('A'); }
        }
        if (s[i] == "AC") {
            if (A == 0 && C == 0) { fin("No"); }
            if (A == 1 && C == 1 && i != N - 1) {
                if (s[i + 1] == "BC") { A--, C++, ans.push_back('C'); }
                else { A++, C--, ans.push_back('A'); }
            } else if (A > C) { A--, C++, ans.push_back('C'); }
            else { A++, C--, ans.push_back('A'); }
        }
        if (s[i] == "BC") {
            if (B == 0 && C == 0) { fin("No"); }
            if (B == 1 && C == 1 && i != N - 1) {
                if (s[i + 1] == "AB") { B++, C--, ans.push_back('B'); }
                else { B--, C++, ans.push_back('C'); }
            } else if (B > C) { B--, C++, ans.push_back('C'); }
            else { B++, C--, ans.push_back('B'); }
        }
    }
    cout << "Yes" << endl;
    rep(i, N) { cout << ans[i] << endl; }
}


Measured memory_bytes: 7192