#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
using namespace std;
void solve();
using ll = long long;
template <class T = ll>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ll ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr ll TEN(int n) {
  ll ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}
template <typename T>
void die(T x) {
  out(x);
  exit(0);
}

#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

inline int popcount(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename T>
vector<int> mkord(int N, function<bool(int, int)> f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

#pragma endregion

constexpr long long MOD = /** 1000000007;  //*/ 998244353;

char dp[100100][5][5][5] = {};

void solve() {
  inl(N, A, B, C);
  vs s(N);
  in(s);
  if (A + B + C == 0) die("No");
  if (A + B + C >= 5) {
    // i ABでi-2回Aが多い　他も同様
    rep(i, 5) rep(j, 5) rep(k, 5) {
      ll a = A, b = B, c = C;
      a += i - 2, b += 2 - i;
      b += j - 2, c += 2 - j;
      a += k - 2, c += 2 - k;
      if (a >= 0 && b >= 0 && c >= 0) {
        dp[N][i][j][k] = 1;
        trc(i, j, k);
      }
    }

    auto ok = [&](int n) { return 0 <= n && n < 5; };
    auto ok2 = [&](int i, int j, int k) { return dp[N][i][j][k]; };
    repr(n, N) rep(i, 5) rep(j, 5) rep(k, 5) {
      if (dp[n + 1][i][j][k] == 0) continue;
      if (s[n] == "AB") {
        if (ok(i - 1) && ok2(i - 1, j, k)) dp[n][i - 1][j][k] = 1;
        if (ok(i + 1) && ok2(i + 1, j, k)) dp[n][i + 1][j][k] = 1;
      }
      if (s[n] == "BC") {
        if (ok(j - 1) && ok2(i, j - 1, k)) dp[n][i][j - 1][k] = 1;
        if (ok(j + 1) && ok2(i, j + 1, k)) dp[n][i][j + 1][k] = 1;
      }
      if (s[n] == "AC") {
        if (ok(k - 1) && ok2(i, j, k - 1)) dp[n][i][j][k - 1] = 1;
        if (ok(k + 1) && ok2(i, j, k + 1)) dp[n][i][j][k + 1] = 1;
      }
    }

    if (dp[0][2][2][2] == 0) die("No");
    out("Yes");
    int i = 2, j = 2, k = 2;
    rep(n, N) {
      if (s[n] == "AB") {
        if (ok(i - 1) && dp[n + 1][i - 1][j][k]) {
          out("B");
          i--;
        } else {
          out("A");
          i++;
        }
      }
      if (s[n] == "BC") {
        if (ok(j - 1) && dp[n + 1][i][j - 1][k]) {
          out("C");
          j--;
        } else {
          out("B");
          j++;
        }
      }
      if (s[n] == "AC") {
        if (ok(k - 1) && dp[n + 1][i][j][k - 1]) {
          out("C");
          k--;
        } else {
          out("A");
          k++;
        }
      }
    }
  } else {
    int M = A + B + C;
    rep(i, 5) rep(j, 5) rep(k, 5) {
      if (i + j + k == M) dp[N][i][j][k] = 1;
    }

    auto ok = [&](int n) { return 0 <= n && n < 5; };
    repr(n, N) rep(i, 5) rep(j, 5) rep(k, 5) {
      if (dp[n + 1][i][j][k] == 0) continue;
      if (s[n] == "AB") {
        if (ok(i - 1) && ok(j + 1)) dp[n][i - 1][j + 1][k] = 1;
        if (ok(i + 1) && ok(j - 1)) dp[n][i + 1][j - 1][k] = 1;
      }
      if (s[n] == "BC") {
        if (ok(j - 1) && ok(k + 1)) dp[n][i][j - 1][k + 1] = 1;
        if (ok(j + 1) && ok(k - 1)) dp[n][i][j + 1][k - 1] = 1;
      }
      if (s[n] == "AC") {
        if (ok(k - 1) && ok(i + 1)) dp[n][i + 1][j][k - 1] = 1;
        if (ok(k + 1) && ok(i - 1)) dp[n][i - 1][j][k + 1] = 1;
      }
    }

    if (dp[0][A][B][C] == 0) die("No");
    out("Yes");
    int i = A, j = B, k = C;
    rep(n, N) {
      if (s[n] == "AB") {
        if (ok(i - 1) && ok(j + 1) && dp[n + 1][i - 1][j + 1][k]) {
          out('B');
          i--, j++;
        } else {
          out("A");
          i++, j--;
        }
      }
      if (s[n] == "BC") {
        if (ok(j - 1) && ok(k + 1) && dp[n + 1][i][j - 1][k + 1]) {
          out("C");
          j--, k++;
        } else {
          out("B");
          j++, k--;
        }
      }
      if (s[n] == "AC") {
        if (ok(k - 1) && ok(i + 1) && dp[n + 1][i+1][j][k-1] ){
          out("A"); i++,k--;
        }
        else{
          out("C"); i--,k++;
        }
      }
    }
  }
}

Measured memory_bytes: 18956