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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>

#if 0
#define INF 1111111

#define KI_MAX (1 << 17) /* 131072 */

typedef struct {
	int data[KI_MAX * 2 - 1];
	int add_all[KI_MAX * 2 - 1];
} ki_t;

int ookikunaihou(int a, int b) {
	return a > b ? b : a;
}

void ki_add_i(ki_t* ki, int idx, int qstart, int qend, int sstart, int send, int delta) {
	if (qend <= sstart || send <= qstart) { /* セグメントがクエリから完全に外れている */
		/* nop */
	} else if (qstart <= sstart && send <= qend) { /* セグメントがクエリに完全に含まれる */
		ki->add_all[idx] += delta;
	} else {
		int smid = sstart + (send - sstart) / 2;
		int lidx = idx * 2 + 1, ridx = idx * 2 + 2;
		ki->add_all[lidx] += ki->add_all[idx];
		ki->add_all[ridx] += ki->add_all[idx];
		ki->add_all[idx] = 0;
		ki_add_i(ki, lidx, qstart, qend, sstart, smid, delta);
		ki_add_i(ki, ridx, qstart, qend, smid, send, delta);
		ki->data[idx] = ookikunaihou(ki->data[lidx] + ki->add_all[lidx], ki->data[ridx] + ki->add_all[ridx]);
	}
}

void ki_add(ki_t* ki, int start, int end, int value) {
	if (start < end) ki_add_i(ki, 0, start, end, 0, KI_MAX, value);


int ki_get_i(const ki_t* ki, int idx, int qstart, int qend, int sstart, int send) {
	if (qend <= sstart || send <= qstart) { /* セグメントがクエリから完全に外れている */
		return -INF;
	} else if (qstart <= sstart && send <= qend) { /* セグメントがクエリに完全に含まれる */
		return ki->data[idx] + ki->add_all[idx];
	} else {
		int smid = sstart + (send - sstart) / 2;
		int left = ki_get_i(ki, idx * 2 + 1, qstart, qend, sstart, smid);
		int right = ki_get_i(ki, idx * 2 + 2, qstart, qend, smid, send);
		return ookikunaihou(left, right) + ki->add_all[idx];
	}
}

int ki_get(const ki_t* ki, int start, int end) {
	return start < end ? ki_get_i(ki, 0, start, end, 0, KI_MAX) : 0;
}
#endif

int N, A, B, C;
char s[114514][4];

int mofu[114514][2];

int stockNum[3][3];
int stock[3][3][114514];
int mew[114514];

int main(void) {
	int i;
	int nyan[3];
	if (scanf("%d%d%d%d", &N, &A, &B, &C) != 4) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%3s", s[i]) != 1) return 1;
		mofu[i][0] = s[i][0] - 'A';
		mofu[i][1] = s[i][1] - 'A';
	}
	nyan[0] = A;
	nyan[1] = B;
	nyan[2] = C;
	for (i = 1; i <= N; i++) {
		if (nyan[mofu[i][0]] > 0) {
			if (nyan[mofu[i][1]] > 0) stock[mofu[i][0]][mofu[i][1]][stockNum[mofu[i][0]][mofu[i][1]]++] = i;
			nyan[mofu[i][0]]--;
			nyan[mofu[i][1]]++;
		} else {
			if (mofu[i][0] == 1) {
				if (nyan[2] > 0) {
					nyan[1]++;
					nyan[2]--;
					mew[i] = 1;
				} else if (stockNum[1][2] > 0) {
					mew[stock[1][2][stockNum[1][2]--]] = 1;
					nyan[1]++;
					nyan[2]--;
				} else {
					puts("No");
					return 0;
				}
			} else {
				if (nyan[mofu[i][1]] > 0) {
					nyan[0]++;
					nyan[mofu[i][1]]--;
					mew[i] = 1;
				} else if (stockNum[0][1] >= stockNum[0][2]) {
					if (stockNum[0][1] == 0) {
						/* これをさらにアレするべきっぽいが… */
						puts("No");
						return 0;
					}
					mew[stock[0][1][stockNum[0][1]--]] = 1;
					nyan[0]++;
					nyan[1]--;
					nyan[mofu[i][0]]--;
					nyan[mofu[i][1]]++;
				} else {
					if (stockNum[0][2] == 0) {
						/* これをさらにアレするべきっぽいが… */
						puts("No");
						return 0;
					}
					mew[stock[0][2][stockNum[0][2]--]] = 1;
					nyan[0]++;
					nyan[2]--;
					nyan[mofu[i][0]]--;
					nyan[mofu[i][1]]++;
				}
			}
		}
	}
	puts("Yes");
	for (i = 1; i <= N; i++) {
		printf("%c\n", s[i][mew[i]]);
	}
	return 0;
}