Problem:
Score : 600 points

Problem Statement

There is a game that involves three variables, denoted A, B, and C.

As the game progresses, there will be N events where you are asked to make a choice.
Each of these choices is represented by a string s_i. If s_i is AB, you must add 1 to A or B then subtract 1 from the other; if s_i is AC, you must add 1 to A or C then subtract 1 from the other; if s_i is BC, you must add 1 to B or C then subtract 1 from the other.

After each choice, none of A, B, and C should be negative.

Determine whether it is possible to make N choices under this condition. If it is possible, also give one such way to make the choices.

Constraints

1 \leq N \leq 10^5

0 \leq A,B,C \leq 10^9

N, A, B, C are integers.

s_i is AB, AC, or BC.

Input

Input is given from Standard Input in the following format:

N A B C
s_1
s_2
:
s_N

Output

If it is possible to make N choices under the condition, print Yes; otherwise, print No.

Also, in the former case, show one such way to make the choices in the subsequent N lines. The (i+1)-th line should contain the name of the variable (A, B, or C) to which you add 1 in the i-th choice.

Sample Input 1

2 1 3 0
AB
AC

Sample Output 1

Yes
A
C

You can successfully make two choices, as follows:

In the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.

In the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.

Sample Input 2

3 1 0 0
AB
BC
AB

Sample Output 2

No

Sample Input 3

1 0 9 0
AC

Sample Output 3

No

Sample Input 4

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB

Sample Output 4

Yes
C
B
B
C
C
B
A
A

Solution in C++ (GCC 9.2.1) (judge verdict: Runtime Error)

//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll sz=5;
  ll n;cin>>n;
  ll a,b,c;cin>>a>>b>>c;
  a=min(a,3LL);
  b=min(b,3LL);
  c=min(c,3LL);
  auto t=make_v(n+1,sz+1,sz+1,sz+1,false);
  t[0][a][b][c]=true;
  //cout<<a spa b spa c<<endl;
  vector<string>str(n);
  rep(i,0,n){
    cin>>str[i];
    string s=str[i];
    rep(x,0,sz+1)rep(y,0,sz+1)rep(z,0,sz+1){
      if(!t[i][x][y][z])continue;
      //cout<<i spa x spa y spa z<<endl;
      if(s=="AB"){
        if(x>=1&&y<=sz-1)t[i+1][x-1][y+1][z]=true;
        if(y>=1&&x<=sz-1)t[i+1][x+1][y-1][z]=true;
      }
      if(s=="BC"){
        if(z>=1&&y<=sz-1)t[i+1][x][y+1][z-1]=true;
        if(y>=1&&z<=sz-1)t[i+1][x][y-1][z+1]=true;
      }
      if(s=="AC"){
        if(x>=1&&z<=sz-1)t[i+1][x-1][y][z+1]=true;
        if(z>=1&x<=sz-1)t[i+1][x+1][y][z-1]=true;
      }
    }
  }
  rep(x,0,sz+1)rep(y,0,sz+1)rep(z,0,sz+1){
    if(!t[n][x][y][z])continue;
    //cout<<x spa y spa z<<endl;
    cout<<"Yes"<<endl;
    vector<string>ret(n);
    ll tx=x,ty=y,tz=z;
    rrep(i,0,n){
      string s=str[i];
      //cout<<s spa tx spa ty spa tz<<endl;
      if(s=="AB"){
        //if(tz<0||tz>sz)break;
        //assert(ty>=0);assert(tx<=sz);assert(tz>=0&&tz<=sz);
        if(tx>=1&&ty<=sz-1&&t[i][tx-1][ty+1][tz]){
          tx=tx--,ty++;
          ret[i]="A";
        }
        else{
          tx++,ty--;
          ret[i]='B';
        }
      }
      if(s=="BC"){
        if(tz>=1&&ty<=sz-1&&t[i][tx][ty+1][tz-1]){
          ty++,tz--;
          ret[i]='C';
        }
        else{
          ty--,tz++;
          ret[i]='B';
        }
      }
      if(s=="AC"){
        if(tx>=1&&tz<=sz-1&&t[i][tx-1][ty][tz+1]){
          tx--,tz++;
          ret[i]='A';
        }
        else{
          //assert(tz!=0);
          tx++,tz--;
          ret[i]='C';
        }
      }
    }
    rep(i,0,n)cout<<ret[i]<<endl;
    return 0;
  }
  cout<<"No"<<endl;
  return 0;
}