#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
 


ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

const ll MX = 5;
bool dp[100005][MX][MX][MX];
pair<pii, pair<int, char> > par[100005][MX][MX][MX];

void solve(int tc) {
  cin >> n >> x >> y >> z;
  dp[0][min(x, MX - 1)][min(y, MX - 1)][min(z, MX - 1)] = 1;
  f0r(i, n) {
    cin >> s;
    pii targ = mp(s[0] - 'A', s[1] - 'A');
    f0r(j, MX) f0r(k, MX) f0r(l, MX) {
      if (dp[i][j][k][l]) {
        ll state[3] = {j, k, l};
        if (state[targ.f] > 0) {
          ll ostate[3];
          f0r(i, 3) ostate[i] = state[i];
          --ostate[targ.f];
          ostate[targ.s] = min(ostate[targ.s] + 1, MX - 1);

          dp[i + 1][ostate[0]][ostate[1]][ostate[2]] = 1;
          par[i + 1][ostate[0]][ostate[1]][ostate[2]] = mp(mp(j, k), mp(l, s[1]));
        }
        if (state[targ.s] > 0) {
          ll ostate[3];
          f0r(i, 3) ostate[i] = state[i];
          --ostate[targ.s];
          ostate[targ.f] = min(ostate[targ.f] + 1, MX - 1);

          dp[i + 1][ostate[0]][ostate[1]][ostate[2]] = 1;
          par[i + 1][ostate[0]][ostate[1]][ostate[2]] = mp(mp(j, k), mp(l, s[0]));
        }
      }
    }
  }

  f0r(j, MX) f0r(k, MX) f0r(l, MX) {
    if (dp[n][j][k][l]) {
      cout << "Yes\n";

      t = "";
      ll state[3] = {j, k, l};
      f1rd(i, n, 1) {
        pair<pii, pair<int, char> > p = par[i][state[0]][state[1]][state[2]];
        t += p.s.s;
        state[0] = p.f.f;
        state[1] = p.f.s;
        state[2] = p.s.f;        
      }
      reverse(all(t));
      f0r(i, n) cout << t[i] << '\n';

      return;
    }
  }

  cout << "No\n";
}
 
int main() {
  send help
 
  // usaco("file");
 
  int tc;
  tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 211308