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)

	/**
 *    author:   K.R.Surrya  
 *    created:  04/05/2020 00:00:36
**/
#include<bits/stdc++.h>
#define vi vector<int>
#define vii vector<vector<int> >
#define vpi vector<pair<int,int> >
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define pb push_back
using namespace std; 

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it)  { return ;}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a,Args... args)
{
    cerr << *it << " = " << a <<endl;
    err(++it,args...);   //args is going to end.
}

long long getVal(vector<long long>&seq,char x) { //int would have done;
    if(x=='A') {
        return seq[0];
    } else if(x=='B') {
        return seq[1];
    } else {
        return seq[2];
    }
}

bool check(vector<long long>& sequence) { 
    for(auto x:sequence) { 
        if(x < 0) { 
            return false;
        }
    }
    return true;
}
void try1() { 
    int N;
    cin >> N;
    long long A,B,C;
    vector<long long> sequence(3);
    for(int i=0;i<3;++i) cin >> sequence[i];
    map<char,int> m;
    m['A']=0;
    m['B']=1;
    m['C']=2;
    string ret="";/*answer*/ 
    vector<string> ques;
    while(N--) { 
        string curr;
        cin >> curr;
        ques.push_back(curr);
    }
    /*map<int,vector<int>> m1;
    vector<int> temp(3,0);
    string last=ques[ques.size()-1];
    for(int i=0;i<last.size();++i) { 
        char curr=last[i];
        ++temp[m[curr]];
    }
    m1[ques.size()-1]=(temp);
    m1[ques.size()]={0,0,0};
    for(int i=ques.size()-1;i>=0;--i) { 
       vector<int> temp=m1[i+1];
       string curr=ques[i];
       for(int j=0;j<curr.size();++j)  ++temp[m[curr[j]]];
       m1[i]=temp;
    }*/
    for(int i=0;i<ques.size();++i) {
        string curr=ques[i];
         char one=curr[0];
         char two=curr[1];

        long long o=getVal(sequence,one);
        long long t=getVal(sequence,two);

        if(o>=t) { 
            if(o==t) { 
                if(i==ques.size()-1) { 
                    ret+=string(1,one);
                    continue;
                    //any of the two would have worked;;
                }
                else { 
                    bool save=false;    //checking for the first character;
                    for(auto ch:ques[i+1]) { 
                        if(ch==one) { 
                            save=true;
                            break;
                        }
                    }
                    if(save) { 
                         ++sequence[m[one]];
                         --sequence[m[two]];
                         ret+=string(1,one);
                    } else {
                        ++sequence[m[two]]; //this character will definitely be present.
                        --sequence[m[one]];
                        ret+=string(1,two);
                    }
                    continue;
                }
            }

           --sequence[m[one]];
           ++sequence[m[two]];
           ret+=string(1,two);/**/
        } else if(t>o) { 
          --sequence[m[two]];
          ++sequence[m[one]];/**/
           ret+=string(1,one);
        }
        /* else {
            int oc=m1[i+1][m[one]];
            int tc=m1[i+1][m[two]];
            if(oc>=tc) {
                ++sequence[m[two]];
                --sequence[m[one]];
                ret+=string(1,two);
            } else if(tc>oc) {
                ++sequence[m[one]];
                --sequence[m[two]];
                ret+=string(1,one);
            }
        } */
        if(!check(sequence)){ 
            cout << "No" << '\n';
            return ;
        }
    }

    bool ok=true;
    for(int i=0;i<3;++i) { 
        if(sequence[i]<0) { 
            ok=false;
            break;
        }
    }   

    if(!ok) { 
        cout << "No" << '\n';
        return ;
    }

    cout << "Yes" << '\n';
    for(auto c:ret) { 
        cout << c << '\n';
    }

}
int main()
{   
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

     auto start = chrono::high_resolution_clock::now();
     try1();
     auto end = chrono::high_resolution_clock::now();

     cerr << " Execution time : " << chrono::duration_cast<chrono::milliseconds>(end-start).count()<<"ms"<<endl;

   
    return 0;
}