#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
//const ll MOD=998244353;

vector<char> ans;
vector<string> V;

void func(int ind,int& X,int& Y,char x,char y){
  if(X>Y){
    ans[ind]=y;
    X--,Y++;
  }else if(X<Y){
    ans[ind]=x;
    X++,Y--;
  }else{
    string nex=V[ind+1];
    if(nex[0]==x||nex[1]==x){
      ans[ind]=x;
      X++,Y--;
    }else{
      ans[ind]=y;
      X--,Y++;
    }
  }
}

void fin(){
  cout<<"No\n";
  exit(0);
}

int main(){
  int N,A,B,C;
  cin>>N>>A>>B>>C;
  V.resize(N);
  rep(i,N) cin>>V[i];
  V.push_back("AA");
  ans.resize(N);

  rep(i,N){
    if(V[i]=="AB"){
      if(A+B==0) fin();
      func(i,A,B,'A','B');
    }
    if(V[i]=="AC"){
      if(A+C==0) fin();
      func(i,A,C,'A','C');
    }
    if(V[i]=="BC"){
      if(B+C==0) fin();
      func(i,B,C,'B','C');
    }
  }
  cout<<"Yes\n";
  rep(i,N) cout<<ans[i]<<endl;
  return 0;
}

### Prompt

Please create a solution in Cpp to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
//const ll MOD=998244353;

vector<char> ans;
vector<string> V;

void func(int ind,int& X,int& Y,char x,char y){
  if(X>Y){
    ans[ind]=y;
    X--,Y++;
  }else if(X<Y){
    ans[ind]=x;
    X++,Y--;
  }else{
    string nex=V[ind+1];
    if(nex[0]==x||nex[1]==x){
      ans[ind]=x;
      X++,Y--;
    }else{
      ans[ind]=y;
      X--,Y++;
    }
  }
}

void fin(){
  cout<<"No\n";
  exit(0);
}

int main(){
  int N,A,B,C;
  cin>>N>>A>>B>>C;
  V.resize(N);
  rep(i,N) cin>>V[i];
  V.push_back("AA");
  ans.resize(N);

  rep(i,N){
    if(V[i]=="AB"){
      if(A+B==0) fin();
      func(i,A,B,'A','B');
    }
    if(V[i]=="AC"){
      if(A+C==0) fin();
      func(i,A,C,'A','C');
    }
    if(V[i]=="BC"){
      if(B+C==0) fin();
      func(i,B,C,'B','C');
    }
  }
  cout<<"Yes\n";
  rep(i,N) cout<<ans[i]<<endl;
  return 0;
}

```