#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())

template <class T>
inline bool chmin(T &a, const T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, const T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}

using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;

const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 29;
const ll INF64 = 1ll << 45;
const int mod = 1000000007;

struct mint
{
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const
  {
    return pow(mod - 2);
  }
  mint &operator/=(const mint a)
  {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const
  {
    mint res(*this);
    return res /= a;
  }
};

int main()
{
  int n;
  ll a, b, c;
  cin >> n >> a >> b >> c;
  ll aa = a, bb = b, cc = c;
  vector<string> s(n);
  vector<string> ans(n);
  rep(i, n) cin >> s[i];
  bool ok = true;
  if (a + b + c == 0)
  {
    cout << "No" << endl;
    return 0;
  }
  if (a + b + c == 1)
  {
    rep(i, n)
    {
      if (s[i] == "AB")
      {
        if (a == 0 && b == 0)
        {
          ok = false;
          break;
        }
        if (b == 1)
          ans[i] = "A";
        else
          ans[i] = "B";
        swap(a, b);
      }
      if (s[i] == "AC")
      {
        if (a == 0 && c == 0)
        {
          ok = false;
          break;
        }
        if (c == 1)
          ans[i] = "A";
        else
          ans[i] = "C";
        swap(a, c);
      }
      if (s[i] == "BC")
      {
        if (b == 0 && c == 0)
        {
          ok = false;
          break;
        }
        if (c == 1)
          ans[i] = "B";
        else
          ans[i] = "C";
        swap(b, c);
      }
    }
  }
  if (a + b + c >= 2)
  {
    if (s[0] == "AB" && a == 0 && b == 0 || s[0] == "AC" && a == 0 && c == 0 || s[0] == "BC" && b == 0 && c == 0) ok = false;
    else {
      rep(i, n) {
        if(s[i] == "AB") {
          if(a == 0 || b == 0) {
            if(a == 0) {
              ++a; --b;
              ans[i] = "A";
            }
            else {
              --a; ++b;
              ans[i] = "B";
            }
          }
          else if((a==1 || b==1) && i < n-1 && s[i] != s[i+1]) {
            if(s[i+1] == "AC") {
              ++a; --b;
              ans[i] = "A";
            }
            else {
              --a; ++b;
              ans[i] = "B";
            }
          }
          else {
            ++a; --b;
            ans[i] = "A";
          }
        }

        if(s[i] == "AC") {
          if(a==0 || c==0) {
            if(a==0) {
              ++a; --c;
              ans[i] = "A";
            }
            else {
              --a; ++c;
              ans[i] = "C";
            }
          }
          else if((a==1 || c==1) && i < n-1 && s[i] != s[i+1]) {
            if(s[i+1] == "AB") {
              ++a; --c;
              ans[i] = "A";
            }
            else {
              --a; ++c;
              ans[i] = "C";
            }
          }
          else {
            ++a; --c;
            ans[i] = "A";
          }
        }

        if(s[i] == "BC") {
          if(b == 0 || c == 0) {
            if(b == 0) {
              ++b; --c;
              ans[i] = "B";
            }
            else {
              --b; ++c;
              ans[i] = "C";
            }
          }
          else if((b==1 || c==1) && i < n-1 && s[i] != s[i+1]) {
            if(s[i+1] == "AB") {
              ++b; --c;
              ans[i] = "B";
            }
            else {
              --b; ++c;
              ans[i] = "C";
            }
          }
          else {
            ++b; --c;
            ans[i] = "B";
          }
        }
      }
    }
  }
  if(ok) {
    cout << "Yes" << endl;
    /*rep(i, n) {
      //cout << aa << " " << bb << " " << cc << " ";
      if(s[i] == "AB") {
        if(ans[i] == "A") { ++aa; --bb; }
        else {--aa; ++bb;}
      }
      if(s[i] == "AC") {
        if(ans[i] == "A") {++aa; --cc;}
        else {--aa; ++cc;}
      }
      if(s[i] == "BC") {
        if(ans[i] == "B") {++bb; --cc;}
        else {--bb; ++cc; }
      }
      if(aa < 0 || bb < 0 || cc < 0) {
        cout << i+1 << endl;
        return 0;
      }
    }*/
    for(auto x : ans) cout << x << endl;
  }
  else cout << "No" << endl;
}

Measured memory_bytes: 9592