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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Main {

  public static void main(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    String[] lines = br.readLine().split(" ");
    int n = Integer.parseInt(lines[0]);
    int[] abc = new int[4];
    abc[1] = Integer.parseInt(lines[1]);  //A
    abc[2] = Integer.parseInt(lines[2]);  //B
    abc[3] = Integer.parseInt(lines[3]);  //C
    String mark = "_ABC";
    char[] history = new char[n];
    int[] commands = new int[n];
    for (int i = 0; i < n; i++) {
      String command = br.readLine();
      if ("AB".equals(command)) {
        commands[i] = 12;
      } else if ("AC".equals(command)) {
        commands[i] = 13;
      } else if ("BC".equals(command)) {
        commands[i] = 23;
      }
    }
    br.close();
    for(int i = 0; i < n; i++){
      int command = commands[i];
      int idx_1 = command / 10;
      int idx_2 = command % 10;

      if(abc[idx_1] == 0 && abc[idx_2] == 0){
        System.out.println("No");
        return;
      }
      if(abc[idx_1] == 0){
        abc[idx_1]++;
        abc[idx_2]--;
        history[i] = mark.charAt(idx_1);
      } else if(abc[idx_2] == 0){
        abc[idx_1]--;
        abc[idx_2]++;
        history[i] = mark.charAt(idx_2);
      } else if(abc[idx_1] == 1 && abc[idx_2] == 1){
        if(i + 1 < n && (commands[i + 1] % 10 == idx_1 || commands[i + 1] / 10 == idx_1)){
          abc[idx_1]++;
          abc[idx_2]--;
          history[i] = mark.charAt(idx_1);
        } else {
          abc[idx_1]--;
          abc[idx_2]++;
          history[i] = mark.charAt(idx_2);
        }
      } else {
        if(abc[idx_1] > abc[idx_2]){
          abc[idx_1]--;
          abc[idx_2]++;
          history[i] = mark.charAt(idx_2);
        } else {
          abc[idx_1]++;
          abc[idx_2]--;
          history[i] = mark.charAt(idx_1);
        }
      }
    }

    PrintWriter pw = new PrintWriter(System.out);
    pw.println("Yes");
    for(int i = 0; i < n; i++){
      pw.println(history[i]);
    }
    pw.flush();
  }
}