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# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Windows;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Atcoder
{
    public class Program
    {
        private static long mod = 1000000007;

        static void Main(string[] args)
        {
            var r = ReadSplit();
            var n = r[0].Int();
            var a = r[1].Long();
            var b = r[2].Long();
            var c = r[3].Long();

            var l = new string[n + 1];
            for (int i = 0; i < n; i++)
            {
                l[i] = Read();
            }
            var ansL = new List<string>();
            for (int i = 0; i < n; i++)
            {
                if (a + b + c == 0)
                {
                    WriteRead("No");
                    return;
                }
                var s = l[i];
                
                if (s == "AB")
                {
                    if (a == 0 && b == 0)
                    {
                        WriteRead("No");
                        return;
                    }
                    if (a == 0)
                    {
                        ansL.Add("A");
                        a++;
                        b--;
                        continue;
                    }

                    if (b == 0)
                    {
                        ansL.Add("B");
                        a--;
                        b++;
                        continue;
                    }

                    if (a > b)
                    {
                        ansL.Add("B");
                        a--;
                        b++;
                        continue;
                    }

                    if (b > a)
                    {
                        ansL.Add("A");
                        a++;
                        b--;
                        continue;
                    }

                    if (l[i + 1] == "AC")
                    {
                        ansL.Add("A");
                        a++;
                        b--;
                        continue;
                    }
                    else
                    {
                        ansL.Add("B");
                        a--;
                        b++;
                        continue;
                    }
                }
                else if (s == "AC")
                {
                    if (a == 0 && c == 0)
                    {
                        WriteRead("No");
                        return;
                    }
                    if (a == 0)
                    {
                        ansL.Add("A");
                        a++;
                        c--;
                        continue;
                    }

                    if (c == 0)
                    {
                        ansL.Add("C");
                        a--;
                        c++;
                        continue;
                    }

                    if (a > c)
                    {
                        ansL.Add("C");
                        a--;
                        c++;
                        continue;
                    }

                    if (c > a)
                    {
                        ansL.Add("A");
                        a++;
                        c--;
                        continue;
                    }

                    if (l[i + 1] == "AB")
                    {
                        ansL.Add("A");
                        a++;
                        c--;
                        continue;
                    }
                    else
                    {
                        ansL.Add("C");
                        a--;
                        c++;
                        continue;
                    }
                }
                else if (s == "BC")
                {
                    if (b == 0 && c == 0)
                    {
                        WriteRead("No");
                        return;
                    }
                    if (b == 0)
                    {
                        ansL.Add("B");
                        b++;
                        c--;
                        continue;
                    }

                    if (c == 0)
                    {
                        ansL.Add("C");
                        b--;
                        c++;
                        continue;
                    }

                    if (b > c)
                    {
                        ansL.Add("C");
                        b--;
                        c++;
                        continue;
                    }

                    if (c > b)
                    {
                        ansL.Add("B");
                        b++;
                        c--;
                        continue;
                    }

                    if (l[i + 1] == "AB")
                    {
                        ansL.Add("B");
                        b++;
                        c--;
                        continue;
                    }
                    else
                    {
                        ansL.Add("C");
                        b--;
                        c++;
                        continue;
                    }
                }
            }

            Write("Yes");
            for (int i = 0; i < ansL.Count; i++)
            {
                Write(ansL[i]);
            }
            Read();
        }

        public static long Lcm(long a, long b)
        {
            return a / Gcd(a, b) * b;
        }
        public static long Gcd(long m, long n)
        {
            if (n == 0) return m;
            return Gcd(n, m % n);
        }

        class ModCombination
        {
            public long _mod = 1000000007;
            public int _max = 1000000;

            long[] fac;
            long[] finv;
            long[] inv;

            public ModCombination() : this(1000000007, 1000000)
            {
            }

            public ModCombination(long mod, int max)
            {
                _mod = mod;
                _max = max;
                fac = new long[max];
                finv = new long[max];
                inv = new long[max];
                fac[0] = fac[1] = 1;
                finv[0] = finv[1] = 1;
                inv[1] = 1;
                for (int i = 2; i < max; i++)
                {
                    fac[i] = fac[i - 1] * i % mod;
                    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
                    finv[i] = finv[i - 1] * inv[i] % mod;
                }
            }

            public long Combination(int n, int m)
            {
                if (n < m) return 0;
                if (n < 0 || m < 0) return 0;
                return fac[n] * (finv[m] * finv[n - m] % _mod) % _mod;
            }
        }

        public static string Read()
        {
            return Console.ReadLine();
        }

        public static string[] ReadSplit()
        {
            return Console.ReadLine().Split(' ');
        }

        public static void WriteRead(object str)
        {
            Console.WriteLine(str);
            Read();
        }

        public static void Write(object str)
        {
            Console.WriteLine(str);
        }

        private static bool ChangeMin<T>(ref T a, T b) where T : IComparable
        {
            if (a.CompareTo(b) > 0)
            {
                a = b;
                return true;
            }
            return false;
        }

        private static bool ChangekMax<T>(ref T a, T b) where T : IComparable
        {
            if (b.CompareTo(a) > 0)
            {
                a = b;
                return true;
            }
            return false;
        }
    }
}


public static class Extentions
{
    public static int Int(this object obj)
    {
        return int.Parse(obj.ToString());
    }

    public static long Long(this object obj)
    {
        return long.Parse(obj.ToString());
    }

    public static decimal Decimal(this object obj)
    {
        return decimal.Parse(obj.ToString());
    }

    public static double Double(this object obj)
    {
        return double.Parse(obj.ToString());
    }

    public static T2 GetValueZero<T1, T2>(this Dictionary<T1, T2> d, T1 key) where T2 : struct
    {
        T2 value;
        if (d.TryGetValue(key, out value))
        {
            return value;
        }
        return new T2();
    }
}