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: Time Limit Exceeded)

//#include <bits/stdc++.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <string.h>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <math.h>
#include <assert.h>
#define ff first
#define ss second
#define ll long long
#define mod 998244353
using namespace std;
ll n, a, b, c;
string s[100009];
set<vector<ll>> added;
vector<pair<vector<ll>, string>> newstates;
void tri(int addi, int subi, ll aa, ll bb, ll cc, string path) {
//    cout<<addi<<" "<<subi<<" "<<aa<<" "<<bb<<" "<<cc<<" "<<path<<endl;
    if(subi == 1) {
        if(aa == 0)
            return;
        else
            aa--;
    }
    if(subi == 2) {
        if(bb == 0)
            return;
        else
            bb--;
    }
    if(subi == 3) {
        if(cc == 0)
            return;
        else
            cc--;
    }
//    cout<<"OK"<<endl;
    if(addi == 1) {
        aa++;
        path.push_back('A');
    }
    if(addi == 2) {
        bb++;
        path.push_back('B');
    }
    if(addi == 3) {
        cc++;
        path.push_back('C');
    }
    vector<ll> temp = {aa, bb, cc};
    if(added.find(temp) != added.end())
        return;
    added.insert(temp);
    newstates.push_back({temp, path});
}
int main () {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>a>>b>>c;
    for(int i=1;i<=n;i++)
        cin>>s[i];
            
    if(a + b + c >= 5) {
        vector<char> ans;
        for(int i=1;i<=n;i++) {
            if(s[i] == "AB") {
                if(a + b <= 1) {
                    cout<<"No\n";
                    return 0;
                }
                if(a < b) {
                    ans.push_back('A');
                    a++;
                    b--;
                }
                else {
                    ans.push_back('B');
                    b++;
                    a--;
                }
            }
            if(s[i] == "AC") {
                if(a + c <= 1) {
                    cout<<"No\n";
                    return 0;
                }
                if(a < c) {
                    ans.push_back('A');
                    a++;
                    c--;
                }
                else {
                    ans.push_back('C');
                    c++;
                    a--;
                }
            }
            if(s[i] == "BC") {
                if(c + b <= 1) {
                    cout<<"No\n";
                    return 0;
                }
                if(c < b) {
                    ans.push_back('C');
                    c++;
                    b--;
                }
                else {
                   ans.push_back('B');
                    b++;
                    c--;
                }
            }
        }
        cout<<"Yes\n";
        for(auto el : ans)
            cout<<el<<endl;
        return 0;
    }
    vector<pair<vector<ll>, string>> states;
    vector<ll> temp = {a, b, c};
    states.push_back({temp, ""});
    for(int i=1;i<=n;i++) {
        newstates.clear();
        added.clear();
        for(auto el : states) {
            ll aa = el.first[0];
            ll bb = el.first[1];
            ll cc = el.first[2];
            string path = el.second;
            if(s[i] == "AB") {
                tri(1, 2, aa, bb, cc, path);
                tri(2, 1, aa, bb, cc, path);
            }
            if(s[i] == "AC") {
                tri(1, 3, aa, bb, cc, path);
                tri(3, 1, aa, bb, cc, path);
            }
            if(s[i] == "BC") {
                tri(2, 3, aa, bb, cc, path);
                tri(3, 2, aa, bb, cc, path);
            }
        }
        states = newstates;
        assert(states.size() <= 24);
        if(states.size() == 0) {
            cout<<"No";
            return 0;
        }
    }
    cout<<"Yes\n";
    for(auto el : states[0].second)
        cout<<el<<endl;
}
/*
 2
 1 1
 1 0
 1 1
 1 1
 */