#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s[ohara], ans;
ll n, cnt, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
ll nex[100000 + 100][5];
int ok;

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> a >> b >> c;
  rep(i, n) cin >> s[i];
  rep(i, n + 1) rep(j, 5) nex[i][j] = INF;
  rep(i, n) {
    rep(j, 2) {
      if (s[i][j] == 'A')
        nex[i][0] = i;
      else if (s[i][j] == 'B')
        nex[i][1] = i;
      else
        nex[i][2] = i;
    }
  }

  rrrep(i, n - 2, 0) {
    rep(j, 3) {
      if (nex[i][j] == INF) nex[i][j] = nex[i + 1][j];
    }
  }

  rep(i, n) {
    // debug(a);
    if (a < 0 || b < 0 || c < 0) ok = 1;
    if (s[i] == "AB") {
      if (a > b) {
        b++;
        a--;
        ans += "B";
      } else if (a < b) {
        b--;
        a++;
        ans += "A";
      } else {
        ll nex1 = nex[i + 1][0], nex2 = nex[i + 1][1];
        // debug(nex1);
        // debug(nex2);
        if (nex1 <= nex2) {
          b--;
          a++;
          ans += "A";
        } else {
          b++;
          a--;
          ans += "B";
        }
      }
    } else if (s[i] == "AC") {
      if (a > c) {
        c++;
        a--;
        ans += "C";
      } else if (a < c) {
        c--;
        a++;
        ans += "A";
      } else {
        ll nex1 = nex[i + 1][0], nex2 = nex[i + 1][2];
        if (nex1 <= nex2) {
          c--;
          a++;
          ans += "A";
        } else {
          c++;
          a--;
          ans += "C";
        }
      }
    } else {
      if (b > c) {
        c++;
        b--;
        ans += "C";
      } else if (b < c) {
        c--;
        b++;
        ans += "B";
      } else {
        ll nex1 = nex[i + 1][1], nex2 = nex[i + 1][2];
        if (nex1 <= nex2) {
          c--;
          b++;
          ans += "B";
        } else {
          c++;
          b--;
          ans += "C";
        }
      }
    }
  }
  if (a < 0 || b < 0 || c < 0) ok = 1;
  if (ok)
    Cout("No");
  else {
    Cout("Yes");
    rep(i, n) Cout(ans[i]);
  }
  return 0;
}

Measured memory_bytes: 38964