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 <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=b-1;i>=a;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

ll N,A,B,C;
vector<string> S;
vector<string> ANS;

int main(){
  cin >> N >>  A >> B >> C;
  rep(i,N){
    string T;cin >> T;
    S.pb(T);
  }
  rep(i,N){
    if(S[i]=="AB"){
      if(A==0 && B==0){
        cNO;
        return 0;
      }
      if(A==0){
        A++;B--;ANS.pb("A");
      }
      else if(B==0){
        B++;A--;ANS.pb("B");
      }
      else if(A==1 && B==1 && C==0){
        if(S[i+1]=="AC"){
          A++;B--;ANS.pb("A");
        }
        else{
          B++;A--;ANS.pb("B");
        }
      }
      else if(A==1){
        A++;B--;ANS.pb("A");
      }
      else if(B==1){
        B++;A--;ANS.pb("B");
      }
      else{
        A++;B--;ANS.pb("A");
      }
    }
    if(S[i]=="AC"){
      if(A==0 && C==0){
        cNO;
        return 0;
      }
      if(A==0){
        A++;C--;ANS.pb("A");
      }
      else if(C==0){
        C++;A--;ANS.pb("C");
      }
      else if(A==1 && C==1 && B==0){
        if(S[i+1]=="AB"){
          A++;C--;ANS.pb("A");
        }
        else{
          C++;A--;ANS.pb("C");
        }
      }
      else if(A==1){
        A++;C--;ANS.pb("A");
      }
      else if(C==1){
        C++;A--;ANS.pb("C");
      }
      else{
        A++;C--;ANS.pb("A");
      }
    }
    if(S[i]=="BC"){
      if(B==0 && C==0){
        cNO;
        return 0;
      }
      if(B==0){
        B++;C--;ANS.pb("B");
      }
      else if(C==0){
        C++;B--;ANS.pb("C");
      }
      else if(B==1 && C==1 && A==0){
        if(S[i+1]=="AB"){
          B++;C--;ANS.pb("B");
        }
        else{
          C++;B--;ANS.pb("C");
        }
      }
      else if(B==1){
        B++;C--;ANS.pb("B");
      }
      else if(C==1){
        C++;B--;ANS.pb("C");
      }
      else{
        B++;C--;ANS.pb("B");
      }
    }
  }
  rep(i,N){
    cout << ANS[i] << endl;
  }
}