#include<cstdio>
#include<cstdlib>

#define int long long

const int MAXN=1e5;

int opt[MAXN+5],stp[MAXN+5];
char str[3];

inline bool compare(const char a[],const char b[]){
	if(a[0]==b[0] && a[1]==b[1])return true;
	return false;
}

int n;

inline void print_path(){
	puts("Yes");
	for(int i=1;i<=n;++i){
		if(stp[i]==1)puts("A");
		else if(stp[i]==2)puts("B");
		else puts("C");
	}
}

void dfs(const int i,const int a,const int b,const int c){
	if(a<0 || b<0 || c<0)return;
	if(i==n+1){
		print_path();
		exit(0);
	}
	if(opt[i]==1){
		stp[i]=1;
		dfs(i+1,a+1,b-1,c);
		stp[i]=2;
		dfs(i+1,a-1,b+1,c);
	}
	else if(opt[i]==2){
		stp[i]=1;
		dfs(i+1,a+1,b,c-1);
		stp[i]=3;
		dfs(i+1,a-1,b,c+1);
	}
	else{
		stp[i]=2;
		dfs(i+1,a,b+1,c-1);
		stp[i]=3;
		dfs(i+1,a,b-1,c+1);
	}
}

int a,b,c;

signed main(){
	scanf("%lld %lld %lld %lld",&n,&a,&b,&c);
	for(int i=1;i<=n;++i){
		scanf("%s",str);
		if(compare(str,"AB"))opt[i]=1;
		else if(compare(str,"AC"))opt[i]=2;
		else opt[i]=3;
	}
	dfs(1,a,b,c);
	puts("No");
	return 0;
}