#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


signed main() {
    int n;
    cin >> n;
    ll a, b, c;
    cin >> a >> b >> c;

    vector<string> t(n + 1);
    rep (i, n) cin >> t[i];
    t[n] = "ABC";
    string ans;
    rep (i, n) {
        string s = t[i];

        char add;
        if (s == "AB") {
            if (a == 0 and b == 0) {
                cout << "No" << endl;
                return 0;
            }
            if (a > b) {
                a--; b++;
                add = 'B';
            }
            else if (a < b) {
                a++; b--;
                add = 'A';
            }
            else {
                bool aa = false;
                rep (j, t[i + 1].size()) {
                    if (t[i + 1][j] == 'A') aa = true;
                }
                if (aa) {
                    a++; b--;
                    add = 'A';
                }
                else {
                    a--; b++;
                    add = 'B';
                }
            }
        }
        if (s == "AC") {
            if (a == 0 and c == 0) {
                cout << "No" << endl;
                return 0;
            }
            if (a > c) {
                a--; c++;
                add = 'C';
            }
            else if (a < c) {
                a++; c--;
                add = 'A';
            }
            else {
                bool aa = false;
                rep (j, t[i + 1].size()) {
                    if (t[i + 1][j] == 'A') aa = true;
                }
                if (aa) {
                    a++; c--;
                    add = 'A';
                }
                else {
                    a--; c++;
                    add = 'C';
                }
            }
        }
        if (s == "BC") {
            if (c == 0 and b == 0) {
                cout << "No" << endl;
                return 0;
            }
            if (b > c) {
                b--; c++;
                add = 'C';
            }
            else if (b < c) {
                b++; c--;
                add = 'B';
            }
            else {
                bool bb = false;
                rep (j, t[i + 1].size()) {
                    if (t[i + 1][j] == 'B') bb = true;
                }
                if (bb) {
                    b++; c--;
                    add = 'B';
                }
                else {
                    b--; c++;
                    add = 'C';
                }
            }
        }
        ans += add;
    }   
    cout << "Yes" << endl;
    rep (i, n) {
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 6688