#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int N, A[5];
int s[101010];


void solve() {
    s[N] = s[N - 1];
    string ans;
    FOR (x, 0, N) {
        bool flag = false;
        bool flag2 = false;
        for (int i = 1; i <= 3; i++) {
            if (s[x] == i)
                continue;
            if (A[i]) {
                flag = true;

                if (A[6 - s[x] - i] == 0) {
                    ans.pb(6 - s[x] - i);
                    flag2 = true;
                    A[6 - s[x] - i]++;
                    A[i]--;
                    break;
                }
            }
        }
        if (!flag) {
            No();
            return;
        }
        if (!flag2) {
            if (s[x + 1] == s[x]) {
                ans.pb(s[x] % 3 + 1);
                A[s[x] % 3 + 1]++;
                A[6 - s[x] - (s[x] % 3 + 1)]--;
            } else {
                ans.pb(6 - s[x] - s[x + 1]);
                A[6 - s[x] - s[x + 1]]++;
                A[s[x + 1]]--;
            }
        }
    }
    Yes();
    for (auto& c : ans) {
        cout << char(c + 'A' - 1) << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N >> A[1] >> A[2] >> A[3];
    FOR (N) {
        string c;
        cin >> c;
        if (c == "AB") {
            s[i] = 3;
        } else if (c == "BC") {
            s[i] = 1;
        } else if (c == "AC")
            s[i] = 2;
    }

    solve();
    return 0;
}


Measured memory_bytes: 4560