#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#include <utility>
#include <set>
#include <stack>
#include <deque>
#include <ctime>
#include <random>
#include <cassert>
#include <cmath>
#include <climits>
#include <queue>
#include <cstring>
#include <bitset>
#include <iomanip>
#include <chrono>

/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#pragma GCC target("avx2")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else 
    #define dbg(x)
#endif

#define int long long
#define fi(a,b) for (int i=a;i<b;i++)
#define fj(a,b) for (int j=a;j<b;j++)
#define fk(a,b) for (int k=a;k<b;k++)
#define fi1(a,b) for (int i=a-1;i>=b;i--)
#define fj1(a,b) for (int j=a-1;j>=b;j--)
#define fk1(a,b) for (int k=a-1;k>=b;k--)
#define fx(x,a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, T2 y) { if (x < y) x = y; }

ostream& operator << (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << ' ';
    return a;
}


typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 200010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[3];

pii reqs[MX];
vi ans;

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, aa, bb, cc;
    cin >> n >> aa >> bb >> cc;
    a[0] = aa;
    a[1] = bb;
    a[2] = cc;
    fi(0, n) {
        str s;
        cin >> s;
        if (s == "AB")
            reqs[i] = {0, 1};
        else if (s == "AC")
            reqs[i] = {0, 2};
        else
            reqs[i] = {1, 2};
    }
    fk(0, n) {
        int i = reqs[k].first;
        int j = reqs[k].second;
        
        if (!a[i] && a[j]) {
            ans.push_back(i);
            ++a[i];
            --a[j];
        } else if (!a[j] && a[i]) {
            ans.push_back(j);
            ++a[j];
            --a[i];
        } else if (!a[i] && !a[j]) {
            cout << "No\n";
            return 0;
        } else {
            if (i != n - 1) {
                int ii = reqs[k + 1].first;
                int jj = reqs[k + 1].second;
                if (ii == i && jj == j) {
                    if (a[i] > a[j]) {
                        ans.push_back(j);
                        --a[i];
                        ++a[j];
                    } else {
                        ans.push_back(i);
                        --a[j];
                        ++a[i];
                    }
                } else if (i == ii || i == jj) {
                     ans.push_back(i);
                        --a[j];
                        ++a[i];
                } else {
                       ans.push_back(j);
                        --a[i];
                        ++a[j];
                } 
            } else {
                ans.push_back(i);
            }
        }

    }       
    
    cout << "Yes\n";
    fi(0, n) 
        cout << char(ans[i] + 'A') << '\n'; 
}

Measured memory_bytes: 5892