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: Accepted)

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

namespace ConsoleApp
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.ReadLine().Split().Select(long.Parse).ToArray();
            var N = input[0];
            var ABC = new ABC { A = input[1], B = input[2], C = input[3] };

            var S = new string[N + 1];
            for (int i = 0; i < N; i++) S[i] = Console.ReadLine();
            S[N] = string.Empty;

            var path = new List<char>();

            for (int i = 0; i < N; i++)
            {
                var c = Set(ABC, S[i], S[i + 1]);
                if (c == null)
                {
                    Console.WriteLine("No");
                    return;
                }
                path.Add(c.Value);
            }

            Console.WriteLine("Yes");
            path.ForEach(c => Console.WriteLine(c));
        }

        static char? Set(ABC abc, string s1, string s2)
        {
            if ((s1 == "AB" && abc.A == 0 && abc.B == 0)
               || (s1 == "AC" && abc.A == 0 && abc.C == 0)
               || (s1 == "BC" && abc.B == 0 && abc.C == 0))
            {
                return null;
            }

            if (s1 == "AB")
            {
                if (abc.A == 0) return abc.Add(1, -1, 0);
                else if (abc.B == 0 || s2.Contains("B")) return abc.Add(-1, 1, 0);
                else return abc.Add(1, -1, 0);
            }

            if (s1 == "AC")
            {
                if (abc.A == 0) return abc.Add(1, 0, -1);
                else if (abc.C == 0 || s2.Contains("C")) return abc.Add(-1, 0, 1);
                else return abc.Add(1, 0, -1);
            }

            if (abc.B == 0) return abc.Add(0, 1, -1);
            else if (abc.C == 0 || s2.Contains("C")) return abc.Add(0, -1, 1);
            else return abc.Add(0, 1, -1);
        }

        class ABC
        {
            public long A { get; set; }
            public long B { get; set; }
            public long C { get; set; }
            public char Add(long a, long b, long c)
            {
                A += a;
                B += b;
                C += c;
                if (a == 1) return 'A';
                if (b == 1) return 'B';
                return 'C';
            }
        }
    }
}