#include <bits/stdc++.h>
 
const double pi = 3.141592653589793238462643383279;
 
 
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
 
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
 
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
 
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
 
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)

//ここから編集

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
    
  int N, a, b, c; cin >> N >> a >> b >> c;
  
{

    bool ok =  true;
    vector<string> v;
    REP(i,N){
      string s; cin >> s;
      v.push_back(s);
    }
    string t = "";
    REP(i,N){
      string s; s = v[i];
      if(s == "AB"){
        if(a == 0 && b == 0){
          ok = false;
        }else if(a == 0){
          a++;
          b--;
          t += 'A';
        }else if(b == 0){
          b++;
          a--;
          t += 'B';
        }else{
          if(i+1 < N){
            if(v[i+1] == "AB"){
              if(a>=b){
                a--;
                b++;
                t += 'B';
              }else{
                a++;
                b--;
                t += 'A';
              }
            }else if(v[i+1] == "AC"){
              b--;
              a++;
              t += 'A';
            }else{
              b++;
              a--;
              t += 'B';
            }
          }else{
            a--;
            b++;
            t += 'B';
          }
        }
        
      }else if(s == "AC"){
        if(a == 0 && c == 0){
          ok = false;
        }else if(a == 0){
          a++;
          c--;
          t += 'A';
        }else if(c == 0){
          a--;
          c++;
          t += 'C';
        }else{
          if(i+1 < N){
            if(v[i+1] == "AB"){
              a++;
              c--;
              t += 'A';
            }else if(v[i+1] == "AC"){
              if(a>=c){
                a--;
                c++;
                t += 'C';
              }else{
                a++;
                c--;
                t += 'A';
              }
            }else{
              a--;
              c++;
              t += 'C';
            }
          }else{
            a--;
            c++;
            
            t += 'C';
          }
        }
      }else{
        if(b == 0 && c == 0){
          ok = false;
        }else if(b == 0){
          b++;
          c--;
          t += 'B';
        }else if(c == 0){
          b--;
          c++;
          t += 'C';
        }else{
          if(i+1 < N){
            if(v[i+1] == "AB"){
              b++;
              c--;
              t += 'B';
            }else if(v[i+1] == "AC"){
              b--;
              c++;
              t += 'C';
            }else{
              if(b>=c){
                b--;
                c++;
                t += 'C';
              }else{
                b++;
                c--;
                t += 'B';
              }
            }
          }else{
            b--;
            c++;
            t += 'C';
          }
        }
      }
    }
    if(!ok){
      cout << "No" << endl;
    }else{
      cout << "Yes" << endl;
      for(int i=0; i<t.size(); i++) cout << t[i] << endl;
    }
  }
  return 0;
}


Measured memory_bytes: 7436