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# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution
{
    static string NextIn1(ref long A, ref long B, ref long C, string s)
    {
        var ans = "";
        switch (s)
        {
            case "AB":
                if (A == 1)
                {
                    A++;
                    B--;
                    return "A";
                }
                else if (B == 1)
                {
                    B++;
                    A--;
                    return "B";
                }
                else
                {
                    return null;
                }
            case "BC":
                if (B == 1)
                {
                    B++;
                    C--;
                    return "B";
                }
                else if (C == 1)
                {
                    C++;
                    B--;
                    return "C";
                }
                else
                {
                    return null;
                }
            case "AC":
                if (A == 1)
                {
                    A++;
                    C--;
                    return "A";
                }
                else if (C == 1)
                {
                    C++;
                    A--;
                    return "C";
                }
                else
                {
                    return null;
                }
        }

        throw new Exception();
    }

    static void Apply(ref long A, ref long B, ref long C, string s, string choice)
    {
        var notChoice = s.Replace(choice, "");
        switch (choice)
        {
            case "A":
                A++;
                break;
            case "B":
                B++;
                break;
            case "C":
                C++;
                break;
        }
        switch (notChoice)
        {
            case "A":
                A--;
                break;
            case "B":
                B--;
                break;
            case "C":
                C--;
                break;
        }
    }

    static string Next(ref long A, ref long B, ref long C, string next, string nnext)
    {
        if (nnext == null)
        {
            var choice = next.Substring(0, 1);
            Apply(ref A, ref B, ref C, next, choice);
            return choice;
        }

        foreach (var c in "ABC")
        {
            if (next.Contains(c) && nnext.Contains(c))
            {
                var choice = c.ToString();
                Apply(ref A, ref B, ref C, next, choice);
                return choice;
            }
        }

        throw new Exception();
    }

    public static void Main()
    {
        var vals = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        var N = vals[0];
        long A = vals[1];
        long B = vals[2];
        long C = vals[3];
        var S = new string[N];
        for (int i = 0; i < N; i++)
        {
            S[i] = Console.ReadLine();
        }

        if (A + B + C == 0)
        {
            Console.WriteLine("No");
        }

        var answer = new List<string>();

        if (A + B + C == 1)
        {
            foreach (var s in S)
            {
                var ans = NextIn1(ref A, ref B, ref C, s);
                if (ans == null)
                {
                    Console.WriteLine("No");
                    return;
                }
                answer.Add(ans);
            }
        }
        else
        {
            var first = S.First();
            if ((first == "AB" && A + B == 0) || (first == "BC" && B + C == 0) || (first == "AC" && A + C == 0))
            {
                Console.WriteLine("No");
                return;
            }

            for (int i = 0; i < N; i++)
            {
                var s = S[i];
                if ((s == "AB" && A + B == 1) || (s == "BC" && B + C == 1) || (s == "AC" && A + C == 1))
                {
                    var ans = NextIn1(ref A, ref B, ref C, s);
                    answer.Add(ans);
                }
                else
                {
                    string ss = i + 1 == N ? null : S[i + 1];
                    var ans = Next(ref A, ref B, ref C, s, ss);
                    answer.Add(ans);
                }
            }
        }

        Console.WriteLine("Yes");
        Console.WriteLine(string.Join(Environment.NewLine, answer));
    }
}