#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define MOD (long long int)(1e9+7)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  if(n <= 1e7){
    ret *= kaijo(n); ret %= MOD;
    ret *= gyaku_kaijo(r); ret %= MOD;
    ret *= gyaku_kaijo(n-r); ret %= MOD;
  }else{
    rep(i,r){
      ret *= n-i; ret %= MOD;
      ret *= mpow(r-i, MOD-2); ret %= MOD;
    }
  }
  return ret;
}

int main(void){
  fast_io
  cout<<fixed<<setprecision(15);

  ll nums[3];
  ll n;cin>>n>>nums[0]>>nums[1]>>nums[2];
  vector<int> S;
  rep(i,n){
    string s; cin>>s;
    if(s == "AB"){
      S.push_back(2);
    }else if(s == "BC"){
      S.push_back(0);
    }else if(s == "AC"){
      S.push_back(1);
    }else{
      assert(false);
    }
  }
  vector<int> ans;
  rep(i,n){
    ll a = nums[0];
    ll b = nums[1];
    ll c = nums[2];
    if(min(a,1ll) + min(b,1ll) + min(c,1ll) == 0){
      cout<<"No"<<endl;
      return 0;
    }else if(min(a,1ll) + min(b,1ll) + min(c,1ll) == 1){
      int emp = S[i];
      if(nums[emp] >= 1){
        cout<<"No"<<endl;
        return 0;
      }
      rep(k,3){
        if(nums[k] == 0 && emp != k){
          ans.push_back(k);
          break;
        }
      }
    }else if(min(a,1ll) + min(b,1ll) + min(c,1ll) == 2){
      int emp = S[i];
      if(nums[emp] == 0){
        if(i == n-1){
          ans.push_back((emp+1)%3);
        }else{
          int next_emp = S[i+1];
          rep(k,3){
            if(k != next_emp && k != emp){
              ans.push_back(k);
              break;
            }
          }
        }
      }else{
        rep(k,3){
          if(k != emp && nums[k] == 0){
            ans.push_back(k);
            break;
          }
        }
      }
    }else{
      int emp = S[i];
      rep(k,3){
        if(k != emp){
          ans.push_back(k);
          break;
        }
      }
    }
    nums[ans.back()]++;
    rep(k,3){
      if(S[i] == k) continue;
      if(ans.back() == k) continue;
      nums[k]--;
    }
    rep(k,3){
      //cerr << nums[k] << " ";
    }
    //cerr << endl;
  }

  cout << "Yes" << endl;
  rep(i,ans.size()){
    if(ans[i] == 0){
      cout << "A" << endl;
    }else if(ans[i] == 1){
      cout << "B" << endl;
    }else{
      cout << "C" << endl;
    }
  }
  return 0;
}

Measured memory_bytes: 4288