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 Rust (1.42.0) (judge verdict: Accepted)

use proconio::input;

// 1箇所に1個: シュミレーションすればいい
// 1箇所に2個以上: AならBCだとだめ。それ以外ならOK。
// 2箇所以上: OK

#[derive(PartialEq, Eq, Clone, Copy)]
enum Query {
    AB,
    AC,
    BC,
}

impl Query {
    fn to_ints(&self) -> (usize, usize) {
        use Query::*;

        match self {
            AB => (A, B),
            AC => (A, C),
            _ => (B, C),
        }
    }

    fn intersection(x: Query, y: Query) -> usize {
        use Query::*;

        match (x, y) {
            (AB, AC) | (AC, AB) => A,
            (AB, BC) | (BC, AB) => B,
            (AC, BC) | (BC, AC) => C,
            _ => x.to_ints().0,
        }
    }
}

const A: usize = 0;
const B: usize = 1;
const C: usize = 2;

const YES: &str = "Yes";
const NO: &str = "No";

fn main() {
    input! {
        n: usize,
        a: i64,
        b: i64,
        c: i64,
        queries: [String; n],
    }

    let mut state = vec![a, b, c];
    let mut ans = vec![];
    for i in 0..n {
        // dbg!(&state);

        let q = parse_query(&queries[i]);
        let (x, y) = q.to_ints();

        if state[x] == 0 && state[y] == 0 {
            println!("{}", NO);
            return;
        }

        // 選択肢がない場合
        if state[x] == 0 {
            state[x] += 1;
            state[y] -= 1;
            ans.push(int_to_char(x));
            continue;
        }
        if state[y] == 0 {
            state[y] += 1;
            state[x] -= 1;
            ans.push(int_to_char(y));
            continue;
        }

        // 選択肢がある場合
        if state[x] > 1 {
            state[y] += 1;
            state[x] -= 1;
            ans.push(int_to_char(y));
            continue;
        }
        if state[y] > 1 {
            state[x] += 1;
            state[y] -= 1;
            ans.push(int_to_char(x));
            continue;
        }

        // どちらも1

        // 最後ならどちらでも
        if i == n - 1 {
            state[x] += 1;
            state[y] -= 1;
            ans.push(int_to_char(x));
            continue;
        }

        // そうでないなら先読みする必要がある
        let next_q = parse_query(&queries[i + 1]);
        if next_q == q {
            // どっちでも
            state[x] += 1;
            state[y] -= 1;
            ans.push(int_to_char(x));
            continue;
        }
        let is = Query::intersection(q, next_q);
        let other = if x == is { y } else { x };
        state[is] += 1;
        state[other] -= 1;
        ans.push(int_to_char(is));
    }

    // dbg!(&state);

    println!("{}", YES);
    for &c in &ans {
        println!("{}", c);
    }
}

fn parse_query(s: &str) -> Query {
    use Query::*;

    match s {
        "AB" => AB,
        "AC" => AC,
        _ => BC,
    }
}

fn int_to_char(x: usize) -> char {
    match x {
        0 => 'A',
        1 => 'B',
        _ => 'C',
    }
}