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 Kotlin (1.3.71) (judge verdict: Wrong Answer)

import java.util.*
import kotlin.math.min

class Pos(val a:Int, val b: Int, val c: Int, val op: String)

fun main(args: Array<String>) {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val a = sc.nextInt()
    val b = sc.nextInt()
    val c = sc.nextInt()
    val dp = Array(n + 1) {Array(4) {Array(4){Array(4){ Pos(-1,-1,-1,"") } } } }
    dp[0][min(3,a)][min(3,b)][min(3,c)] = Pos(-1,-1,-1,"X")

    var last:Pos? = null
    repeat(n) {i->
        val s = sc.next()
        for (ai in 0..3) {
            for (bi in 0..3) {
                for (ci in 0..3) {
                    if (dp[i][ai][bi][ci].op == "") continue
                    for (next in getNext(s, ai, bi, ci)) {
                        val prePos = Pos(ai, bi, ci, next.op)
                        if (next.a > 3 || next.b > 3 || next.c > 3) continue
                        dp[i + 1][next.a][next.b][next.c] = prePos
                        if (i + 1 == n) {
                            last = prePos
                        }
                    }
                }
            }
        }
    }

    if (last == null) {
        println("No")
        return
    }

    val ans = mutableListOf<String>()
    for (i in n-1 downTo 0) {
        ans.add(last!!.op)
        last = dp[i][last!!.a][last!!.b][last!!.c]
    }
    println("Yes")
    println(ans.reversed().joinToString("\n"))
}

fun getNext(s: String, ai: Int, bi: Int, ci: Int): List<Pos> {
    val res = mutableListOf<Pos>()
    when (s) {
        "AB" -> {
            if (ai > 0) res.add(Pos(ai - 1, bi + 1, ci, "A"))
            if (bi > 0) res.add(Pos(ai + 1, bi - 1, ci, "B"))
        }
        "AC" -> {
            if (ai > 0) res.add(Pos(ai - 1, bi, ci + 1, "A"))
            if (ci > 0) res.add(Pos(ai + 1, bi, ci - 1, "C"))
        }
        else -> {
            if (bi > 0) res.add(Pos(ai, bi - 1, ci + 1, "B"))
            if (ci > 0) res.add(Pos(ai, bi + 1, ci - 1, "C"))
        }
    }
    return res
}