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: Wrong Answer)

// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
}
ll n;
signed main(){
  init_io();
  ll a,b,c,ac=0,bc=0,cc=0;
  ll bc_cnt=0,ab_cnt=0,ac_cnt=0;
  cin >> n >> a >> b >> c;
  vector<string> s(n);
  vector<char> ans(n,' '),n_c(n);
  vector<ll> le_b(n),le_c(n);
  for(int i=0;i<n;i++){
    cin >> s[i];
    if(s[i]=="AB") n_c[i] = 'C',ab_cnt++;
    if(s[i]=="BC") n_c[i] = 'A',bc_cnt++;
    if(s[i]=="AC") n_c[i] = 'B',ac_cnt++;
    for(auto ch:s[i]){
      if(ch=='A') a++,ac++;
      else if(ch=='B') b++,bc++;
      else c++,cc++;
    }
  }
  if(a<0||b<0||c<0){
    cout << "No\n";
    return 0;
  }
  a /= 2;
  b /= 2;
  c /= 2;
  for(int i=0;i<n;i++){
    if(n_c[i]!='A'){
      a--;
      if(s[i]=="AB"){
        ans[i] = 'B';
      }else{
        ans[i] = 'C';
      }
    }
  }
  for(int i=0;i<n;i++){
    if(s[i]=="AB"){
      if(b>0&&a<0){
        b--;
        a++;
        ans[i] = 'A';
      }
    }else if(s[i]=="AC"){
      if(c>0&&a<0){
        c--;
        a++;
        ans[i] = 'A';
      }
    }
  }
  for(int i=0;i<n;i++){
    if(s[i]=="BC"){
      if(b>0){
        b--;
        ans[i] = 'C';
      }else{
        c--;
        ans[i] = 'B';
      }
    }
  }
  if(a<0||b<0||c<0){
    cout << "No\n";
    return 0;
  }
  cout <<"Yes\n";
  for(int i=0;i<n;i++){
    cout << ans[i]<<endl;
  }
}