#include <bits/stdc++.h>

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using f64 = double;
using f80 = long double;

#define FOR(v, a, b) for(i64 v = (a); v < (b); ++v)
#define FORE(v, a, b) for(i64 v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(i64 v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif

using namespace std;

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T> void pout(const T &value){std::cout << value << "\n";}
template <typename T, typename ...Args> void pout(const T &value, const Args&... args){std::cout << value << " ";pout(args...);}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}
template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));}


struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;



int main(){
  i64 N, A, B, C;

  while(cin >> N >> A >> B >> C){
    vector<string> s(N); cin >> s;

    dump(s);

    vector<char> ans;
    bool ok = true;

    if(A + B + C == 0){
      ok = false;
    }else if(A + B + C == 1){
      for(auto p : s){
        if(p == "AB"){
          if(A) A = 0, B = 1, ans.push_back('B');
          else if(B) A = 1, B = 0, ans.push_back('A');
          else ok = false;
        }else if(p == "AC"){
          if(A) A = 0, C = 1, ans.push_back('C');
          else if(C) A = 1, C = 0, ans.push_back('A');
          else ok = false;
        }else{
          if(C) C = 0, B = 1, ans.push_back('B');
          else if(B) C = 1, B = 0, ans.push_back('C');
          else ok = false;
        }
      }
    }else if(A + B + C == 2){
      REP(i,N){
        if(s[i] == "AB"){
          if(A + B == 0) ok = false;
          if(A == 0) A++, B--, ans.push_back('A');
          else if(B == 0) A--, B++, ans.push_back('B');
          else{
            if(i + 1 < N){
              if(s[i+1] == "AC"){
                A++, B--, ans.push_back('A');
              }else{
                A--, B++, ans.push_back('B');                
              }
            }else{
              ans.push_back('A');
            }
          }
        }else if(s[i] == "AC"){
          if(A + C == 0) ok = false;
          if(A == 0) A++, C--, ans.push_back('A');
          else if(C == 0) A--, C++, ans.push_back('C');
          else{
            if(i + 1 < N){
              if(s[i+1] == "AB"){
                A++, C--, ans.push_back('A');
              }else{
                A--, C++, ans.push_back('C');                
              }
            }else{
              ans.push_back('A');
            }
          }
        }else{
          if(C + B == 0) ok = false;
          if(C == 0) C++, B--, ans.push_back('C');
          else if(B == 0) C--, B++, ans.push_back('B');
          else{
            if(i + 1 < N){
              if(s[i+1] == "AC"){
                C++, B--, ans.push_back('C');
              }else{
                C--, B++, ans.push_back('B');                
              }
            }else{
              ans.push_back('C');
            }
          }
          
        }
      }
      
    }else{
      for(auto p : s){
        if(p == "AB"){
          if(A + B == 0) ok = false;
          if(A < B) A++, B--, ans.push_back('A');
          else A--, B++, ans.push_back('B');
        }else if(p == "AC"){
          if(A + C == 0) ok = false;
          if(A < C) A++, C--, ans.push_back('A');
          else A--, C++, ans.push_back('C');
        }else{
          if(C + B == 0) ok = false;
          if(C < B) C++, B--, ans.push_back('C');
          else C--, B++, ans.push_back('B');
        }
      }
    }

    dump(ans);

    if(ok){
      pout("Yes");
      join(cout, ALL(ans), "\n");
    }else{
      pout("No");
    }
  }

  return 0;
}


Measured memory_bytes: 6652