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-csc 3.5.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, a, b, c;
        sc.Multi(out n, out a, out b, out c);
        int m = 6;
        a = Math.Min(a, m);
        b = Math.Min(b, m);
        c = Math.Min(c, m);
        var s = new string[n];
        var dp = new bool[n + 1][][][];
        for (int i = 0; i < n + 1; i++)
        {
            dp[i] = new bool[m + 1][][];
            for (int j = 0; j < m + 1; j++)
            {
                dp[i][j] = new bool[m + 1][];
                for (int k = 0; k < m + 1; k++)
                {
                    dp[i][j][k] = new bool[m + 1];
                }
            }
        }
        for (int j = 0; j <= a; j++)
        {
            for (int k = 0; k <= b; k++)
            {
                for (int l = 0; l <= c; l++)
                {
                    dp[0][j][k][l] = true;
                }
            }
        }
        for (int i = 0; i < n; i++)
        {
            s[i] = sc.Str;
            if (s[i] == "AB") {
                for (int j = 0; j < m + 1; j++)
                {
                    for (int k = 0; k < m + 1; k++)
                    {
                        for (int l = 0; l < m + 1; l++)
                        {
                            if (j > 0) {
                                dp[i + 1][j - 1][Math.Min(k + 1, m)][l] |= dp[i][j][k][l];
                            }
                            if (k > 0) {
                                dp[i + 1][Math.Min(j + 1, m)][k - 1][l] |= dp[i][j][k][l];
                            }
                        }
                    }
                }
            }
            if (s[i] == "AC") {
                for (int j = 0; j < m + 1; j++)
                {
                    for (int k = 0; k < m + 1; k++)
                    {
                        for (int l = 0; l < m + 1; l++)
                        {
                            if (j > 0) {
                                dp[i + 1][j - 1][k][Math.Min(l + 1, m)] |= dp[i][j][k][l];
                            }
                            if (l > 0) {
                                dp[i + 1][Math.Min(j + 1, m)][k][l - 1] |= dp[i][j][k][l];
                            }
                        }
                    }
                }
            }
            if (s[i] == "BC") {
                for (int j = 0; j < m + 1; j++)
                {
                    for (int k = 0; k < m + 1; k++)
                    {
                        for (int l = 0; l < m + 1; l++)
                        {
                            if (k > 0) {
                                dp[i + 1][j][k - 1][Math.Min(l + 1, m)] |= dp[i][j][k][l];
                            }
                            if (l > 0) {
                                dp[i + 1][j][Math.Min(k + 1, m)][l - 1] |= dp[i][j][k][l];
                            }
                        }
                    }
                }
            }
        }
        int p = -1, q = -1, r = -1;
        for (int j = 0; j < m + 1; j++)
        {
            for (int k = 0; k < m + 1; k++)
            {
                for (int l = 0; l < m + 1; l++)
                {
                    if (dp[n][j][k][l]) {
                        p = j;
                        q = k;
                        r = l;
                    }
                }
            }
        }
        if (p == -1) {
            Prt("No");
            return;
        }
        var ans = new char[n];
        for (int i = n - 1; i >= 0 ; i--)
        {
            // DBG(p, q, r);
            if (s[i] == "AB") {
                if (p > 0 && dp[i][p - 1][Math.Min(q + 1, m)][r]) {
                    --p;
                    q = Math.Min(q + 1, m);
                    ans[i] = 'A';
                }
                else {
                    --q;
                    p = Math.Min(p + 1, m);
                    ans[i] = 'B';
                }
            }
            if (s[i] == "AC") {
                if (p > 0 && dp[i][p - 1][q][Math.Min(r + 1, m)]) {
                    --p;
                    r = Math.Min(r + 1, m);
                    ans[i] = 'A';
                }
                else {
                    --r;
                    p = Math.Min(p + 1, m);
                    ans[i] = 'C';
                }
            }
            if (s[i] == "BC") {
                if (q > 0 && dp[i][p][q - 1][Math.Min(r + 1, m)]) {
                    --q;
                    r = Math.Min(r + 1, m);
                    ans[i] = 'B';
                }
                else {
                    --r;
                    q = Math.Min(q + 1, m);
                    ans[i] = 'C';
                }
            }
        }
        Prt("Yes");
        foreach (var item in ans)
        {
            Prt(item);
        }
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
    public static void Deconstruct<T>(this IList<T> v, out T a) {
        a = v[0];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b) {
        a = v[0]; b = v[1];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) {
        a = v[0]; b = v[1]; c = v[2];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4];
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}