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 <bits/stdc++.h>
#define ALL(a)  (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
#define MOD 1000000007LL
#define endl "\n"

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll N, A, B, C;
  cin >> N >> A >> B >> C;
  vll query(N);
  for(int i = 0; i < N; i++){
    string s;
    cin >> s;
    if(s == "AB") query.at(i) = 0;
    else if(s == "BC") query.at(i) = 1;
    else query.at(i) = 2;
  }

  bool ok = true;
  if(query.at(0) == 0 && A == 0 && B == 0) ok = false;
  if(query.at(0) == 1 && B == 0 && C == 0) ok = false;
  if(query.at(0) == 2 && C == 0 && A == 0) ok = false;

  if((A == 1 && B == 0 && C == 0) || (A == 0 && B == 1 && C == 0) || (A == 0 && B == 0 && C == 1)){
    for(int i = 0; i < N; i++){
      if(query.at(i) == 0){
        if(A == 0 && B == 0) ok = false;
        if(A == 1){
          A = 0; B = 1;
        }
        else{
          A = 1; B = 0;
        }
      }
      else if(query.at(i) == 1){
        if(B == 0 && C == 0) ok = false;
        if(B == 1){
          B = 0; C = 1;
        }
        else{
          B = 1; C = 0;
        }
      }
      else{
        if(C == 0 && A == 0) ok = false;
        if(C == 1){
          C = 0; A = 1;
        }
        else{
          C = 1; A = 0;
        }
      }
    }
  }
  if(!ok){
    cout << "No" << endl;
    return 0;
  }

  vll ans(0);

  for(int i = 0; i < N; i++){
    if(query.at(i) == 0){
      if(A == 0 && B == 0) ok = false;
      else if(A == 1 && B == 1 && C == 0 && i != N-1){
        if(query.at(i+1) == 0){
          ans.push_back(0); // << 'A' << endl;
          A++; B--;
        }
        else if(query.at(i+1) == 1){
          ans.push_back(1); //cout << 'B' << endl;
          A--; B++;
        }
        else{
          ans.push_back(0); //cout << 'A' << endl;
          A++; B--;
        }
      }
      else if(A >= B){
        ans.push_back(1); //cout << 'B' << endl;
        A--; B++;
      }
      else{
        ans.push_back(0); //cout << 'A' << endl;
        A++; B--;
      }
    }
    else if(query.at(i) == 1){
      if(B == 0 && C == 0) ok = false;
      else if(A == 0 && B == 1 && C == 1 && i != N-1){
        if(query.at(i+1) == 0){
          ans.push_back(1); //cout << 'B' << endl;
          B++; C--;
        }
        else if(query.at(i+1) == 1){
          ans.push_back(1); //cout << 'B' << endl;
          B++; C--;
        }
        else{
          ans.push_back(2); //cout << 'C' << endl;
          B--; C++;
        }
      }
      else if(B >= C){
        ans.push_back(2); //cout << 'C' << endl;
        B--; C++;
      }
      else{
        ans.push_back(1); //cout << 'B' << endl;
        B++; C--;
      }
    }
    else{
      if(C == 0 && A == 0) ok = false;
      else if(A == 1 && B == 0 && C == 1 && i != N-1){
        if(query.at(i+1) == 0){
          ans.push_back(0); //cout << 'A' << endl;
          C--; A++;
        }
        else if(query.at(i+1) == 1){
          ans.push_back(2); //cout << 'C' << endl;
          C++; A--;
        }
        else{
          ans.push_back(2); //cout << 'C' << endl;
          C++; A--;
        }
      }
      else if(C >= A){
        ans.push_back(0); //cout << 'A' << endl;
        C--; A++;
      }
      else{
        ans.push_back(2); //cout << 'C' << endl;
        C++; A--;
      }
    }
    if(A < 0 || B < 0 || C < 0){
      ok = false;
      break;
    }
  }
  if(!ok){
    cout << "No" << endl;
    return 0;
  }
  else{
    cout << "Yes" << endl;
    for(auto x: ans) cout << (char)(x + 'A') << endl;
  }
}