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>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;

int main(){
  ll n, a, b, c;
  in(n);
  in3(a, b, c);
  bool h = true;
  string s;
  s = "";
  vector<string> t(n);
  rep(i, n)
    in(t[i]);
  rep(i, n){
    if(t[i] == "AB"){
      if(a == 0 && b == 0){
        h = false;
        break;
      }
      if(a > b){
        b++;
        a--;
        s += "B";
      }
      else if(a < b){
        b--;
        a++;
        s += "A";
      }
      else{
        if(i == n - 1){
          s += "A";
        }
        else{
          if(t[i + 1] == "AB"){
            s += "A";
            a++;
            b--;
          }
          else if(t[i + 1] == "BC"){
            if(b > c){
              b++;
              a--;
              s += "B";
            }
            else{
              a++;
              b--;
              s += "A";
            }
          }
          else{
            if(a > c){
              a++;
              b--;
              s += "A";
            }
            else{
              b++;
              a--;
              s += "B";
            }
          }
        }
      }
    }
    if(t[i] == "BC"){
      if(b == 0 && c == 0){
        h = false;
        break;
      }
      if(b > c){
        c++;
        b--;
        s += "C";
      }
      else if(b < c){
        c--;
        b++;
        s += "B";
      }
      else{
        if(i == n - 1){
          s += "B";
        }
        else{
          if(t[i + 1] == "BC"){
            s += "B";
            b++;
            c--;
          }
          else if(t[i + 1] == "CA"){
            if(c > a){
              c++;
              b--;
              s += "C";
            }
            else{
              b++;
              c--;
              s += "B";
            }
          }
          else{
            if(b > a){
              b++;
              c--;
              s += "B";
            }
            else{
              c++;
              b--;
              s += "C";
            }
          }
        }
      }
    }
    if(t[i] == "CA"){
      if(c == 0 && b == a){
        h = false;
        break;
      }
      if(c > a){
        a++;
        c--;
        s += "A";
      }
      else if(c < a){
        a--;
        c++;
        s += "C";
      }
      else{
        if(i == n - 1){
          s += "C";
        }
        else{
          if(t[i + 1] == "CA"){
            s += "C";
            c++;
            a--;
          }
          else if(t[i + 1] == "AB"){
            if(b > c){
              a++;
              c--;
              s += "A";
            }
            else{
              c++;
              a--;
              s += "C";
            }
          }
          else{
            if(c > b){
              c++;
              a--;
              s += "C";
            }
            else{
              a++;
              c--;
              s += "A";
            }
          }
        }
      }
    }
  }
  if(h){
    out("Yes");
    memi;
    rep(i, n){
      out(s[i]);
      memi;
    }
  }
  else{
    out("No");
    memi;
  }
}