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 Go (1.14.1) (judge verdict: Wrong Answer)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func main() {
	sc.Split(bufio.ScanWords)
	N := getInt()
	A, B, C := getInt(), getInt(), getInt()
	s := make([]string, N)
	for i := 0; i < N; i++ {
		s[i] = getString()
	}

	if A+B+C == 0 {
		out("No")
		return
	}

	ans := make([]byte, 0)
	for i := 0; i < N; i++ {
		switch s[i] {
		case "AB":
			if A == 0 && B == 0 {
				out("No")
				return
			}
			if A == 0 {
				ans = append(ans, 'A')
				A++
				B--
			} else if B == 0 {
				ans = append(ans, 'B')
				B++
				A--
			} else {
				if i+1 != N {
					if s[i+1] == "BC" {
						ans = append(ans, 'B')
						B++
						A--
					} else {
						ans = append(ans, 'A')
						A++
						B--
					}
				} else {
					ans = append(ans, 'A')
					A++
					B--
				}
			}
		case "BC":
			if B == 0 && C == 0 {
				out("No")
				return
			}
			if B == 0 {
				ans = append(ans, 'B')
				B++
				A--
			} else if C == 0 {
				ans = append(ans, 'C')
				C++
				B--
			} else {
				if i+1 != N {
					if s[i+1] == "AB" {
						ans = append(ans, 'B')
						B++
						C--
					} else {
						ans = append(ans, 'C')
						C++
						B--
					}
				} else {
					ans = append(ans, 'B')
					B++
					C--
				}
			}
		case "AC":
			if A == 0 && C == 0 {
				out("No")
				return
			}
			if A == 0 {
				ans = append(ans, 'A')
				A++
				C--
			} else if C == 0 {
				ans = append(ans, 'C')
				C++
				A--
			} else {
				if i+1 != N {
					if s[i+1] == "AB" {
						ans = append(ans, 'A')
						A++
						C--
					} else {
						ans = append(ans, 'C')
						C++
						A--
					}
				} else {
					ans = append(ans, 'C')
					C++
					A--
				}
			}
		}
	}

	out("Yes")
	for _, v := range ans {
		out(string(v))
	}
}