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.*;

 public class Main{
// taking inputs
static BufferedReader s1;
static BufferedWriter out;
static String read() throws IOException{String line="";while(line.length()==0){line=s1.readLine();continue;}return line;}
static int int_v (String s1){return Integer.parseInt(s1);}
static long long_v(String s1){return Long.parseLong(s1);}
static int[] int_arr() throws IOException{String[] a=read().split(" ");int[] b=new int[a.length];for(int i=0;i<a.length;i++){b[i]=int_v(a[i]);}return b;}
static long[] long_arr() throws IOException{String[] a=read().split(" ");long[] b=new long[a.length];for(int i=0;i<a.length;i++){b[i]=long_v(a[i]);}return b;}
static void assign(){s1=new BufferedReader(new InputStreamReader(System.in));out=new BufferedWriter(new OutputStreamWriter(System.out));}

//......................................@uthor_Alx..............................................

static Long find(int x, int y){
	long xx=(long)(x+y)*(x+y+1);
	return xx/2;
}
   public static void main(String[] args) throws  IOException{
	        		  assign();
	        		  int[] n1=int_arr();
	        		  int n=n1[0],a=n1[1],b=n1[2],c=n1[3];
	        		  List<Character> l=new ArrayList<>();
	        		  boolean bb=true;
	        		  String[] arr=new String[n];
	        		  int[] cc=new int[3];
	        		  for(int i=0;i<n;i++){
	        		  	arr[i]=read();
	        		  	cc[arr[i].charAt(0)-'A']++;
	        		  	cc[arr[i].charAt(1)-'A']++;
	        		  }
	        		  

	        		  for(int i=0;i<n;i++){
	        		  	String s=arr[i];
	        		  	if(s.equals("AB")){
	        		  		if(a==0&&b==0){bb=false;break;}
	        		  		if(a>b){
	        		  			l.add('B');
	        		  			a--;b++;
	        		  		}
	        		  		else if(b>a){
	        		  			l.add('A');
	        		  			a++;b--;
	        		  		}
	        		  		else{
	        		  			if(i+1<n){
	        		  				char c1=arr[i+1].charAt(0);
	        		  				if(c1=='A'){
	        		  					l.add('A');
	        		  					a++;b--;
	        		  				}
	        		  				else{
	        		  					l.add('B');
	        		  					a--;b++;
	        		  				}
	        		  			}
	        		  			else{
	        		  				l.add('B');
	        		  				a--;b++;
	        		  			}
	        		  		}
	        		  	}
	        		  	else if(s.equals("BC")){
	        		  		if(b==0&&c==0){bb=false;break;}
	        		  		if(c>b){
	        		  			l.add('B');
	        		  			c--;b++;
	        		  		}
	        		  		else if(b>c){
	        		  			l.add('C');
	        		  			c++;b--;
	        		  		}
	        		  		else{
	        		  			if(i+1<n){
	        		  				char c1=arr[i+1].charAt(1);
	        		  				if(c1=='B'){
	        		  					l.add('B');
	        		  					c--;b++;
	        		  				}
	        		  				else{
	        		  					l.add('C');
	        		  					c++;b--;
	        		  				}
	        		  			}
	        		  			else{
	        		  				l.add('C');
	        		  				c++;b--;
	        		  			}
	        		  		}
	        		  	}
	        		  	else{
	        		  		if(a==0&&c==0){bb=false;break;}
	        		  		if(a>c){
	        		  			l.add('C');
	        		  			a--;c++;
	        		  		}
	        		  		else if(c>a){
	        		  			l.add('A');
	        		  			a++;c--;
	        		  		}
	        		  		else{
	        		  			if(i+1<n){
	        		  				char c2=arr[i+1].charAt(1);
	        		  				char c1=arr[i+1].charAt(0);
	        		  				if(c1=='B'){
	        		  					l.add('C');
	        		  					a--;c++;
	        		  				}
	        		  				else {
	        		  					l.add('A');
	        		  					a++;c--;
	        		  				}
	        		  			}
	        		  			else{
	        		  				l.add('C');
	        		  				a--;c++;
	        		  			}
	        		  		}
	        		  	}
	        		  }
	        		  if(!bb){out.write("No");}
	        		  else{
	        		  	out.write("Yes\n");
	        		  	for(char cc1:l){out.write(cc1+"\n");}
	        		  }
	        	
	        		// if(n[0]>0){out.write("Yes");}
	        		 //else{out.write("No");}
                      out.flush();
	        		 
	}
}