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;

#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif

#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;

void solve() {
  int n, a, b, c;
  cin >> n >> a >> b >> c;
  int ca = 0, cb = 0, cc = 0;
  vi cmd;
  rep(i, n) {
    string s;
    cin >> s;
    if (s == "AB") {
      ca++, cb++;
      cmd.push_back(0);
    } else if (s == "AC") {
      ca++, cc++;
      cmd.push_back(1);
    } else {
      cb++, cc++;
      cmd.push_back(2);
    }
  }
  dump(a, b, c);
  dump(ca, cb, cc);
  int mn = 0;
  mins(mn, ca);
  mins(mn, cb);
  mn = mn / 2 * 2;
  ca -= mn;
  cb -= mn;
  mn = 0;
  mins(mn, cb);
  mins(mn, cc);
  mn = mn / 2 * 2;
  cb -= mn;
  cc -= mn;
  mn = 0;
  mins(mn, cc);
  mins(mn, ca);
  mn = mn / 2 * 2;
  cc -= mn;
  ca -= mn;
  dump(ca, cb, cc);
  if (a == 0 && b == 0 && ca > 0 && cb > 0) {
    cout << "No" << endl;
    return;
  }
  if (b == 0 && c == 0 && cb > 0 && cc > 0) {
    cout << "No" << endl;
    return;
  }
  if (a == 0 && c == 0 && ca > 0 && cc > 0) {
    cout << "No" << endl;
    return;
  }
  cout << "Yes" << endl;
  rep(i, n) {
    if (cmd[i] == 0) {
      if (a < b) {
        a++;
        b--;
        cout << "A" << endl;
      } else {
        a--;
        b++;
        cout << "B" << endl;
      }
    } else if (cmd[i] == 1) {
      if (a < c) {
        a++;
        c--;
        cout << "A" << endl;
      } else {
        a--;
        c++;
        cout << "C" << endl;
      }
    } else if (cmd[i] == 2) {
      if (b < c) {
        b++;
        c--;
        cout << "B" << endl;
      } else {
        b--;
        c++;
        cout << "C" << endl;
      }
    }
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  // freopen("temp.1", "r", stdin);
  solve();
  return 0;
}