#include"bits/stdc++.h"

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF * 300 * 300;
const int MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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

void Main()
{
    VL a(3);
    LL n;
    cin>>n>>a[0]>>a[1]>>a[2];

    VS s(n);

    REP(i,n){
        cin>>s[i];
    }

    vector<char> result(n);

    REP(i,n){
        int x,y;
        if(s[i] == "AB"){
            x=0;
            y=1;
        }
        if(s[i] == "AC"){
            x=0;
            y=2;
        }
        if(s[i] == "BC"){
            x=1;
            y=2;
        }

        if(a[x]==0 && a[y]==0){
            cout<<"No"<<endl;
            return;
        }
        else if(a[x]<a[y]){
            a[x]++;
            a[y]--;
            result[i] = x+'A';
            continue;
        }
        else if(a[x]>a[y]){
            a[x]--;
            a[y]++;
            result[i] = y+'A';
            continue;
        }
        else{
            if(i == n-1){
                result[i] = x+'A';
                continue;
            }
            else{
                if(x==0 && s[i+1][0]=='A'){
                    a[x]++;
                    a[y]--;
                    result[i] = x+'A';
                    continue;
                }
                else if(x==1 && (s[i+1][0]=='B'||s[i+1][1]=='B')){
                    a[x]++;
                    a[y]--;
                    result[i] = x+'A';
                    continue;
                }
                else{
                    a[x]--;
                    a[y]++;
                    result[i] = y+'A';
                    continue;
                }
            }
            
        }
    }

    cout<<"Yes"<<endl;
    REP(i,n){
        cout<<result[i]<<endl;
    }

    
    return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}

Measured memory_bytes: 6668