import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.function.IntPredicate;
import java.util.stream.IntStream;

public class Main {
    static void solve(MyScanner in, MyWriter out) {
        int n = in.nextInt();
        long a = in.nextLong();
        long b = in.nextLong();
        long c = in.nextLong();
        long d = a + b + c;
        if (d == 0) {
            out.println("No");
            return;
        }
        long[] abc = {a, b, c};
        String[] s = IntStream.range(0, n)
                              .mapToObj(i -> in.next())
                              .toArray(String[]::new);
        IntPredicate ok = i -> {
            int x = s[i].charAt(0) - 'A';
            int y = s[i].charAt(1) - 'A';
            return !(abc[x] == 0 && abc[y] == 0);
        };
        Op op = i -> {
            int x = s[i].charAt(0) - 'A';
            int y = s[i].charAt(1) - 'A';
            if (abc[x] == 0) {
                abc[x] = 1;
                abc[y]--;
                return (char)(x + 'A');
            }
            if (abc[y] == 0) {
                abc[x]--;
                abc[y] = 1;
                return (char)(y + 'A');
            }
            if (i + 1 == n || s[i].equals(s[i + 1])) {
                abc[x]++;
                abc[y]--;
                return (char)(x + 'A');
            }
            if (s[i].equals("AB")) {
                if (s[i + 1].equals("AC")) {
                    abc[x]++;
                    abc[y]--;
                    return (char)(x + 'A');
                }
                // s[i + 1].equals("BC")
                abc[x]--;
                abc[y]++;
                return (char)(y + 'A');
            }
            if (s[i].equals("AC")) {
                if (s[i + 1].equals("AB")) {
                    abc[x]++;
                    abc[y]--;
                    return (char)(x + 'A');
                }
                // s[i + 1].equals("BC")
                abc[x]--;
                abc[y]++;
                return (char)(y + 'A');
            }
            // s[i].equals("BC")
            if (s[i + 1].equals("AB")) {
                abc[x]++;
                abc[y]--;
                return (char)(x + 'A');
            }
            // s[i + 1].equals("AC")
            abc[x]--;
            abc[y]++;
            return (char)(y + 'A');
        };
        if (d == 1) {
            var answer = new char[n];
            for (int i = 0; i < n; i++) {
                if (!ok.test(i)) {
                    out.println("No");
                    return;
                }
                answer[i] = op.apply(i);
            }
            out.println("Yes");
            for (char ch : answer)
                out.println(ch);
            return;
        }
        if (!ok.test(0)) {
            out.println("No");
            return;
        }
        out.println("Yes");
        for (int i = 0; i < n; i++) {
            out.println(op.apply(i));
        }
    }
    private interface Op {
        char apply(int i);
    }
    public static void main(String[] args) {
        MyWriter w = new MyWriter(System.out);
        solve(new MyScanner(System.in), w);
        w.flush();
    }
    static final class MyScanner {
        static final int BUFFER_SIZE = 8192;
        private final InputStream in;
        private final byte[] buffer = new byte[BUFFER_SIZE];
        private int point;
        private int readLength;

        MyScanner(InputStream in) {
            this.in = in;
        }
        private int readByte() {
            if (point < readLength) {
                int result = buffer[point];
                point += 1;
                return result;
            }
            try {
                readLength = in.read(buffer);
            } catch (IOException e) {
                throw new AssertionError(null, e);
            }
            if (readLength == -1) {
                return -1;
            }
            point = 1;
            return buffer[0];
        }
        private static boolean isVisibleChar(int c) {
            return 33 <= c && c <= 126;
        }
        char nextChar() {
            int c = readByte();
            while (!(c == -1 || isVisibleChar(c))) {
                c = readByte();
            }
            if (c == -1) {
                throw new NoSuchElementException();
            }
            return (char)c;
        }
        String next() {
            return next(16);
        }
        String next(int n) {
            int c = readByte();
            while (!(c == -1 || isVisibleChar(c))) {
                c = readByte();
            }
            if (c == -1) {
                throw new NoSuchElementException();
            }
            StringBuilder b = new StringBuilder(n);
            do {
                b.append((char)c);
                c = readByte();
            } while (c != -1 && isVisibleChar(c));
            return b.toString();
        }
        long nextLong() {
            int c = readByte();
            while (!(c == -1 || isVisibleChar(c))) {
                c = readByte();
            }
            if (c == -1) {
                throw new NoSuchElementException();
            }
            boolean minus = false;
            long limit = -Long.MAX_VALUE;
            if (c == '-') {
                minus = true;
                limit = Long.MIN_VALUE;
                c = readByte();
            }
            long n = 0L;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                if (n < limit / 10L) {
                    throw new InputMismatchException();
                }
                n *= 10L;
                int digit = c - '0';
                if (n < limit + digit) {
                    throw new InputMismatchException();
                }
                n -= digit;
                c = readByte();
            } while (c != -1 && isVisibleChar(c));
            return minus ? n : -n;
        }
        int nextInt() {
            long n = nextLong();
            if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) {
                throw new InputMismatchException();
            }
            return (int)n;
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        int[] nextIntArray(int n) {
            int[] result = new int[n];
            for (int i = 0; i < n; i++) {
                result[i] = nextInt();
            }
            return result;
        }
        long[] nextLongArray(int n) {
            long[] result = new long[n];
            for (int i = 0; i < n; i++) {
                result[i] = nextLong();
            }
            return result;
        }
        char[] nextCharArray(int n) {
            char[] result = new char[n];
            for (int i = 0; i < n; i++) {
                result[i] = nextChar();
            }
            return result;
        }
        char[][] next2dCharArray(int n, int m) {
            char[][] result = new char[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    result[i][j] = nextChar();
                }
            }
            return result;
        }
        int[][] nextVerticalIntArrays(int arrayCount, int arrayLength) {
            int[][] result = new int[arrayCount][arrayLength];
            for (int i = 0; i < arrayLength; i++) {
                for (int j = 0; j < arrayCount; j++) {
                    result[j][i] = nextInt();
                }
            }
            return result;
        }
        long[][] nextVerticalLongArrays(int arrayCount, int arrayLength) {
            long[][] result = new long[arrayCount][arrayLength];
            for (int i = 0; i < arrayLength; i++) {
                for (int j = 0; j < arrayCount; j++) {
                    result[j][i] = nextLong();
                }
            }
            return result;
        }
        char[][] nextVerticalCharArrays(int arrayCount, int arrayLength) {
            char[][] result = new char[arrayCount][arrayLength];
            for (int i = 0; i < arrayLength; i++) {
                for (int j = 0; j < arrayCount; j++) {
                    result[j][i] = nextChar();
                }
            }
            return result;
        }
    }
    static final class MyWriter extends PrintWriter {
        MyWriter(OutputStream out) {
            super(out);
        }
        void println(int[] x) {
            println(x, " ");
        }
        void println(int[] x, String delimiter) {
            if (x.length > 0) {
                print(x[0]);
                for (int i = 1; i < x.length; i++) {
                    print(delimiter);
                    print(x[i]);
                }
            }
            println();
        }
        void println(long[] x) {
            println(x, " ");
        }
        void println(long[] x, String delimiter) {
            if (x.length > 0) {
                print(x[0]);
                for (int i = 1; i < x.length; i++) {
                    print(delimiter);
                    print(x[i]);
                }
            }
            println();
        }
        void println(Iterable<?> iterable) {
            println(iterable, " ");
        }
        void println(Iterable<?> iterable, String delimiter) {
            Iterator<?> i = iterable.iterator();
            if (i.hasNext()) {
                print(i.next());
                while (i.hasNext()) {
                    print(delimiter);
                    print(i.next());
                }
            }
            println();
        }
        void printLines(int[] x) {
            println(x, System.lineSeparator());
        }
        void printLines(long[] x) {
            println(x, System.lineSeparator());
        }
        void printLines(Iterable<?> iterable) {
            println(iterable, System.lineSeparator());
        }
    }
}


Measured memory_bytes: 48668