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 Ruby (2.7.1) (judge verdict: Runtime Error)

#exec({'RUBY_THREAD_VM_STACK_SIZE'=>'100000000'},'/usr/bin/ruby', $0) if !ENV['RUBY_THREAD_VM_STACK_SIZE']
require 'prime'

def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def sum(a) a.inject(:+) end

def big(a,b) return (a>b)? a:b end

def small(a,b) return (a<b)? a:b end

n,a,b,c = inp
abc = [a,b,c]
ans = []
st = "ABC"
h = {"AB" => [0,1],"BC"=>[1,2],"AC"=>[2,0]}
ss=[]
cs=[]
me = nil
n.times do |i|
  ss << gets.chomp
  if(me != ss[i])
    me = ss
    cs << ss[i]
  end
end
csi = 0
csize =cs.size
cs << cs[-1]
me = nil
n.times do |i|
  s= ss[i]
  if(s == cs[csi])
    csi = small(csi+1,csize-1)
  end
  cd = h[s]
  if(abc[cd[0]]==abc[cd[1]] and abc[cd[0]] == 1)
    unless(h[ss[i+1]].include?(cd[0]))
      abc[cd[0]] -= 1
      abc[cd[1]] += 1
      ans << st[cd[1]]
    else
      abc[cd[0]] += 1
      abc[cd[1]] -= 1
      ans << st[cd[0]]
    end
  elsif(abc[cd[0]]>=abc[cd[1]])
    abc[cd[0]] -= 1
    abc[cd[1]] += 1
    ans << st[cd[1]]
  else
    abc[cd[0]] += 1
    abc[cd[1]] -= 1
    ans << st[cd[0]]
  end
  unless abc.all?{|u|u>=0}
    puts "No"
    exit
  end
end
puts "Yes"
puts ans