Problem: 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.

Examples

Input

2 1 3 0
AB
AC


Output

Yes
A
C


Input

3 1 0 0
AB
BC
AB


Output

No


Input

1 0 9 0
AC


Output

No


Input

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB


Output

Yes
C
B
B
C
C
B
A
A

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.PrintWriter;
public class Main{
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int a=sc.nextInt();
		int b=sc.nextInt();
		int c=sc.nextInt();
		char[] ans=new char[n];
		String[] s=new String[n];
		for(int i=0; i<n; i++){
			s[i]=sc.next();
		}
		if(a+b+c==2){
			ArrayList<State> list=new ArrayList<>();
			String tmp=s[0];
			for(int i=0; i<n; i++){
				if(!tmp.equals(s[i])){
					list.add(new State(i-1,tmp));
					tmp=s[i];
				}
			}
			list.add(new State(n-1,tmp));
			int li=0;
			for(int i=0; i<n; i++){
				if(i-1==list.get(li).count){
					li++;
				}
				if(s[i].equals("AB")){
				if(a>b){
					a--;
					b++;
					ans[i]='B';
				}else if(a<b){
					b--;
					a++;
					ans[i]='A';
				}else{
					if(list.get(li).count==i){
						if(list.get(Math.min(list.size()-1,li+1)).idx.equals("BC")){
							b++;
							a--;
							ans[i]='B';
						}else{
							a++;
							b--;
							ans[i]='A';
						}
					}else{
						b--;
						a++;
						ans[i]='A';
					}
				}
			}else if(s[i].equals("BC")){
				if(c>b){
					c--;
					b++;
					ans[i]='B';
				}else if(c<b){
					b--;
					c++;
					ans[i]='C';
				}else{
					if(list.get(li).count==i){
						if(list.get(Math.min(list.size()-1,li+1)).idx.equals("AB")){
							b++;
							c--;
							ans[i]='B';
						}else{
							c++;
							b--;
							ans[i]='C';
						}
					}else{
						b--;
						c++;
						ans[i]='C';
					}
				}
			}else{
				if(a>c){
					a--;
					c++;
					ans[i]='C';
				}else if(a<c){
					c--;
					a++;
					ans[i]='A';
				}else{
					if(list.get(li).count==i){
						if(list.get(Math.min(list.size()-1,li+1)).idx.equals("BC")){
							c++;
							a--;
							ans[i]='C';
						}else{
							a++;
							c--;
							ans[i]='A';
						}
					}else{
						c--;
						a++;
						ans[i]='A';
					}
				}
			}
			if(a<0 || b<0 || c<0){
				System.out.println("No");
				return;
			}
			}
		}else{
		for(int i=0; i<n; i++){
			if(s[i].equals("AB")){
				if(a>b){
					a--;
					b++;
					ans[i]='B';
				}else{
					b--;
					a++;
					ans[i]='A';
				}
			}else if(s[i].equals("BC")){
				if(c>b){
					c--;
					b++;
					ans[i]='B';
				}else{
					b--;
					c++;
					ans[i]='C';
				}
			}else{
				if(a>c){
					a--;
					c++;
					ans[i]='C';
				}else{
					c--;
					a++;
					ans[i]='A';
				}
			}
			if(a<0 || b<0 || c<0){
				System.out.println("No");
				return;
			}
		}
		}
		System.out.println("Yes");
		for(int i=0; i<n; i++){
			System.out.println(ans[i]);
		}
	}
	static class State{
		int count;
		String idx;
		State(int count,String idx){
			this.count=count;
			this.idx=idx;
		}
	}
}