#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
#include <functional>
#include <random>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef vector<long double> vld;
typedef vector<vld> vvld;
typedef unordered_map<ll, ll> uii;
typedef unordered_map<ll, ll> uuii;
typedef unordered_map<ll, ll> uuuii;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
typedef vector<vvpl> vvvpl;
typedef pair<ll, PL> TL;
typedef vector<TL> vtl;
typedef vector<vtl> vvtl;
typedef bitset<64> bs;
const ll LINF = 1e18;
const long double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define rep(i, n) for(ll i = 0; i < n; i++)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define ALL(X) (X).begin(),(X).end()

template <typename T> T gcd(T a, T b) {return (a == 0) ? b : gcd(b%a, a);}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b;}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec /* copy */){
    sort(ALL(vec)); vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec;
}

inline ll popcnt(ll x){return __builtin_popcountll((unsigned long long)x);};
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
//friend bool operator<(const tpl& lhs, const tpl& rhs){
//    return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
//}

bool bit(ll st, ll b){return ((st>>b)&1) == 1;}


int main(){
#ifdef __DEBUG_LOCAL__
    ifstream file("../../../../../in.txt"); if(file.is_open()) cin.rdbuf(file.rdbuf());
#endif
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    
    ll N, A, B, C; cin >> N >> A >> B >> C;
    vs S(N);
    rep(i, N){
        cin >> S[i];
    }
    
    ll K = 7;
    vvvvb dp(N+1, vvvb(K, vvb(K, vb(K, false))));
    dp[0][min(K-2, A)][min(K-2, B)][min(K-2, C)] = true;
    
    vvvvl prev(N+1, vvvl(K, vvl(K, vl(K, -1))));
    
    rep(i, N){
        
        rep(a, K) rep(b, K) rep(c, K) if(dp[i][a][b][c]){
            if(S[i] == "AB"){
                if(a != 0 && b+1 < K){
                    dp[i+1][a-1][b+1][c] = true;
                    prev[i+1][a-1][b+1][c] = 'B';
                }
                if(b != 0 && a+1 < K){
                    dp[i+1][a+1][b-1][c] = true;
                    prev[i+1][a+1][b-1][c] = 'A';
                }
            }
            else if(S[i] == "AC"){
                if(a != 0 && c+1 < K){
                    dp[i+1][a-1][b][c+1] = true;
                    prev[i+1][a-1][b][c+1] = 'C';
                }
                if(c != 0 && a+1 < K){
                    dp[i+1][a+1][b][c-1] = true;
                    prev[i+1][a+1][b][c-1] = 'A';
                }
            }
            else{
                if(b != 0 && c+1 < K){
                    dp[i+1][a][b-1][c+1] = true;
                    prev[i+1][a][b-1][c+1] = 'C';
                }
                if(c != 0 && b+1 < K){
                    dp[i+1][a][b+1][c-1] = true;
                    prev[i+1][a][b+1][c-1] = 'B';
                }
            }
        }
    }
    
    
    rep(a, K) rep(b, K) rep(c, K) if(dp[N][a][b][c]){
        cout << "Yes" << endstr;
        deque<char> dq;
        
        ll ca = a, cb = b, cc = c;
        for(ll idx = N; idx > 0; idx--){
            char ch = (char)prev[idx][ca][cb][cc];
            dq.push_front(ch);
            if(S[idx-1] == "AB"){
                if(ch == 'A'){
                    ca--; cb++;
                }
                else{
                    ca++; cb--;
                }
            }
            else if(S[idx-1] == "AC"){
                if(ch == 'A'){
                    ca--; cc++;
                }
                else{
                    ca++; cc--;
                }
            }
            else{
                if(ch == 'B'){
                    cb--; cc++;
                }
                else{
                    cb++; cc--;
                }
            }
        }
        
        rep(i, N) cout << dq[i] << endstr;
        
        return 0;
    }
    
    cout << "No" << endstr;
    return 0;
}


Measured memory_bytes: 822112