#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
using ll = long long;

unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n,a,b,c;
    cin >> n >> a >> b >> c;
    if (a + b + c == 0)cout << "No" << endl;
    else if (a + b + c == 1 || a+b+c>2) {
        vector<char> s(n);
        s.at(n - 1) = 'Z';
        for (int i = 0; i < n; i++) {
            string t;
            cin >> t;
            if (t == "AB") {
                if (a == 0 && b == 0) {
                    cout << "No" << endl;
                    break;
                }
                if (a > b) {
                    a--; b++;
                    s.at(i) = 'B';
                }
                else {
                    a++; b--;
                    s.at(i) = 'A';
                }
            }
            if (t == "AC") {
                if (a == 0 && c == 0) {
                    cout << "No" << endl;
                    break;
                }
                if (a > c) {
                    a--; c++;
                    s.at(i) = 'C';
                }
                else {
                    a++; c--;
                    s.at(i) = 'A';
                }
            }
            if (t == "BC") {
                if (b == 0 && c == 0) {
                    cout << "No" << endl;
                    break;
                }
                if (c > b) {
                    c--; b++;
                    s.at(i) = 'B';
                }
                else {
                    c++; b--;
                    s.at(i) = 'C';
                }
            }
        }
        if (s.at(n - 1) != 'Z') {
            cout << "Yes" << endl;
            for (int i = 0; i < n; i++) {
                cout << s.at(i) << endl;
            }
        }

    }
    else {
    vector<string> x(n+1);
    for (int i = 0; i < n; i++) {
        cin >> x.at(i);
    }

    vector<char> s(n);
    s.at(n - 1) = 'Z';
    for (int i = 0; i < n; i++) {
        string t;
        t = x.at(i);
        if (t == "AB") {
            if (a == 0 && b == 0) {
                cout << "No" << endl;
                break;
            }
            if (a > b) {
                a--; b++;
                s.at(i) = 'B';
            }
            else if(b>a) {
                a++; b--;
                s.at(i) = 'A';
            }
            else if (x.at(i + 1) == "AC") {
                a++; b--;
                s.at(i) = 'A';
            }
            else {
                a--; b++;
                s.at(i) = 'B';
            }
        }
        if (t == "AC") {
            if (a == 0 && c == 0) {
                cout << "No" << endl;
                break;
            }
            if (a > c) {
                a--; c++;
                s.at(i) = 'C';
            }
            else if(c>a){
                a++; c--;
                s.at(i) = 'A';
            }
            else if (x.at(i + 1) == "AB") {
                a++; c--;
                s.at(i) = 'A';
            }
            else {
                a--; c++;
                s.at(i) = 'C';
            }
        }
        if (t == "BC") {
            if (b == 0 && c == 0) {
                cout << "No" << endl;
                break;
            }
            if (c > b) {
                c--; b++;
                s.at(i) = 'B';
            }
            else if(b>c){
                c++; b--;
                s.at(i) = 'C';
            }
            else if (x.at(i + 1) == "AC") {
                c++; b--;
                s.at(i) = 'C';
            }
            else {
                c--; b++;
                s.at(i) = 'B';
            }
        }
    }
    if (s.at(n - 1) != 'Z') {
        cout << "Yes" << endl;
        for (int i = 0; i < n; i++) {
            cout << s.at(i) << endl;
        }
    }

    }
}

Measured memory_bytes: 6404