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

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var a = ni();
        var b = ni();
        var c = ni();
        var s = ns(n);
        var memo = new bool?[n + 1, 15, 15];
        var dppath = new DpPath3<string>(n + 1, 15, 15);
        a = Math.Min(4, a);
        b = Math.Min(4, b);
        c = Math.Min(4, c);
        var sum = a + b + c;
        bool dfs(int pos, int na, int nb) {
            var nc = sum - na - nb;
            if (na < 0 || nb < 0 || nc < 0) return false;
            if (pos == n) return true;

            if (!memo[pos, na, nb].HasValue) {
                bool val = false;
                var da = 0;
                var db = 0;
                if (s[pos][0] == 'A') da = 1;
                if (s[pos][0] == 'B') db = 1;
                if (s[pos][1] == 'A') da = -1;
                if (s[pos][1] == 'B') db = -1;

                if (dfs(pos + 1, na + da, nb + db)) {
                    val = true;
                    dppath.SetPath(pos, na, nb, pos + 1, na + da, nb + db, "" + s[pos][0]);
                } else if (dfs(pos + 1, na - da, nb - db)) {
                    val = true;
                    dppath.SetPath(pos, na, nb, pos + 1, na - da, nb - db, "" + s[pos][1]);
                }

                memo[pos, na, nb] = val;
            }
            return memo[pos, na, nb].Value;
        }
        var res = dfs(0, a, b);
        if (res) {
            cout.WriteLine("Yes");
            cout.WriteLine(string.Join("\n", dppath.GetPath(0, a, b)));
        } else {
            cout.WriteLine("No");
        }
    }

}

public class DpPath3<T> {
    private readonly int?[] _prev;
    private readonly T[] _event;
    private readonly int _size0, _size1, _size2;
    private int ToId(int v0, int v1, int v2) {
        var id = v0;
        id = id * _size1 + v1;
        id = id * _size2 + v2;
        return id;
    }
    public DpPath3(int v0, int v1, int v2) {
        _size0 = v0;
        _size1 = v1;
        _size2 = v2;
        _prev = new int?[v1 * v0 * v2];
        _event = new T[v1 * v0 * v2];
    }

    public void SetPath(int v0, int v1, int v2, int prevV0, int prevV1, int prevV2, T t) {
        var id = ToId(v0, v1, v2);
        _prev[id] = ToId(prevV0, prevV1, prevV2);
        _event[id] = t;
    }

    public List<T> GetPath(int v0, int v1, int v2) {
        var id = ToId(v0, v1, v2);
        var path = new List<T>();
        while (_prev[id].HasValue) {
            path.Add(_event[id]);
            id = _prev[id].Value;
        }
        return path;
    }
}

public class DpPath4<T> {
    private readonly int?[] _prev;
    private readonly T[] _event;
    private readonly int _size0, _size1, _size2, _size3;
    private int ToId(int v0, int v1, int v2, int v3) {
        var id = v0;
        id = id * _size1 + v1;
        id = id * _size2 + v2;
        id = id * _size3 + v3;
        return id;
    }
    public DpPath4(int v0, int v1, int v2, int v3) {
        _size0 = v0;
        _size1 = v1;
        _size2 = v2;
        _size3 = v3;
        _prev = new int?[v1 * v0 * v2 * v3];
        _event = new T[v1 * v0 * v2 * v3];
    }

    public void SetPath(int v0, int v1, int v2, int v3, int prevV0, int prevV1, int prevV2, int prevV3, T t) {
        var id = ToId(v0, v1, v2, v3);
        _prev[id] = ToId(prevV0, prevV1, prevV2, prevV3);
        _event[id] = t;
    }

    public List<T> GetPath(int v0, int v1, int v2, int v3) {
        var id = ToId(v0, v1, v2, v3);
        var path = new List<T>();
        while (_prev[id].HasValue) {
            path.Add(_event[id]);
            id = _prev[id].Value;
        }
        return path;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}