#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#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 repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(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)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


void solve() {
  int n; cin >> n;
  int a, b, c; cin >> a >> b >> c;
  vector<string> s(n); cin >> s;

  vi ab, ac, bc;
  rep(i,n) {
    if (s[i] == "AB") ab.emplace_back(i);
    else if (s[i] == "AC") ac.emplace_back(i);
    else bc.emplace_back(i);
  }
  ab.emplace_back(n);
  ac.emplace_back(n);
  bc.emplace_back(n);

  vector<char> ans(n);

  rep(i,n) {
    if (s[i] == "AB") {
      if (a < b) {
        ++a, --b;
        ans[i] = 'A';
      } else if (a > b) {
        --a, ++b;
        ans[i] = 'B';
      } else {
        if (a == 0) {
          cout << "No\n";
          return;
        }
        int fa = *lower_bound(ALL(ac), i);
        int fb = *lower_bound(ALL(bc), i);
        if (fa < fb) {
          if ((fa - i) & 1) {
            ++a, --b;
            REP(j,i,fa-1) {
              ans[j] = 'A' + (j-i) % 2;
            }
          } else {
            REP(j,i,fa-1) {
              ans[j] = 'A' + j % 2;
            }
          }
          i = fa - 1;
        }
        else {
          if ((fb - i) & 1) {
            --a, ++b;
            REP(j,i,fb-1) {
              ans[j] = 'B' - (j-i) % 2;
            }
          } else {
            REP(j,i,fb-1) {
              ans[j] = 'A' + j % 2;
            }
          }
          i = fb - 1;
        }
      }
    }

    if (s[i] == "AC") {
      if (a < c) {
        ++a, --c;
        ans[i] = 'A';
      } else if (a > c) {
        --a, ++c;
        ans[i] = 'C';
      } else {
        if (a == 0) {
          cout << "No\n";
          return;
        }
        int fa = *lower_bound(ALL(ab), i);
        int fc = *lower_bound(ALL(bc), i);
        if (fa < fc) {
          if ((fa - i) & 1) {
            ++a, --c;
            REP(j,i,fa-1) {
              ans[j] = 'A' + (j-i) % 2 * 2;
            }
          } else {
            REP(j,i,fa-1) {
              ans[j] = 'A' + j % 2 * 2;
            }
          }
          i = fa - 1;
        }
        else {
          if ((fc - i) & 1) {
            --a, ++c;
            REP(j,i,fc-1) {
              ans[j] = 'C' - (j-i) % 2 * 2;
            }
          } else {
            REP(j,i,fc-1) {
              ans[j] = 'A' + j % 2 * 2;
            }
          }
          i = fc - 1;
        }
      }
    }

    if (s[i] == "BC") {
      if (b < c) {
        ++b, --c;
        ans[i] = 'B';
      } else if (b > c) {
        --b, ++c;
        ans[i] = 'C';
      } else {
        if (b == 0) {
          cout << "No\n";
          return;
        }
        int fb = *lower_bound(ALL(ab), i);
        int fc = *lower_bound(ALL(ac), i);
        if (fb < fc) {
          if ((fb - i) & 1) {
            ++b, --c;
            REP(j,i,fb-1) {
              ans[j] = 'B' + (j-i) % 2;
            }
          } else {
            REP(j,i,fb-1) {
              ans[j] = 'B' + j % 2;
            }
          }
          i = fb - 1;
        }
        else {
          if ((fc - i) & 1) {
            --b, ++c;
            REP(j,i,fc-1) {
              ans[j] = 'C' - (j-i) % 2;
            }
          } else {
            REP(j,i,fc-1) {
              ans[j] = 'B' + j % 2;
            }
          }
          i = fc - 1;
        }
      }
    }
  }

  cout << "Yes\n";
  interval[0] = "\n";
  cout << ans << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 7280