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)

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>

using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll long long
typedef pair<int,int> P;
const int inf=1000000007;
const int MOD=1000000007;
signed main(){
  int n,a,b,c;
  bool flag=true;
  cin>>n>>a>>b>>c;
  vector<string> s(n);
  rep(i,n){
    cin>>s[i];
  }
  vector<char> res(n);
  queue<int> que;
  for(int i=0;i<n;++i){
    //standby
    if(!que.empty()){
      if(s[que.front()]==s[i]){
        que.pop();
      }
      else if(s[i]=="AC"){
        if(a==0&&c==0){
          if(s[que.front()]=="BC"){
            res[que.front()]='C';
            b-=2;
            c+=2;
          }
          que.pop();
        }
        else{
          que.pop();
        }
      }
      else if(s[i]=="BC"){
        if(b==0&&c==0){
          if(s[que.front()]=="AC"){
            res[que.front()]='C';
            a-=2;
            c+=2;
          }
          que.pop();
        }
        else{
          que.pop();
        }
      }
      else{
        que.pop();
      }
    }
    //main fase
    if(s[i]=="AB"){
      if(a>b){
        --a;++b;
        res[i]='B';
      }
      else if(a<b){
        ++a;--b;
        res[i]='A';
      }
      else{
        if(a==0){
          flag=false;
        }
        else{
          ++a;--b;
          res[i]='A';
          que.push(i);
        }
      }
    }
    else if(s[i]=="AC"){
      if(a>c){
        --a;++c;
        res[i]='C';
      }
      else if(a<c){
        ++a;--c;
        res[i]='A';
      }
      else{
        if(a==0){
          flag=false;
        }
        else{
          ++a;--c;
          res[i]='A';
          que.push(i);
        }
      }
    }
    else if(s[i]=="BC"){
      if(b>c){
        --b;++c;
        res[i]='C';
      }
      else if(b<c){
        ++b;--c;
        res[i]='B';
      }
      else{
        if(b==0){
          flag=false;
        }
        else{
          ++b;--c;
          res[i]='B';
          que.push(i);
        }
      }
    }
  }
	if(flag){
    cout<<"Yes"<<endl;
    rep(i,n){
      cout<<res[i]<<"\n";
    }
  }
  else{
    cout<<"No"<<endl;
  }
  return 0;
}