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;
#[allow(unused_imports)]
use proconio::marker::*;

struct ABC {
    a: i64,
    b: i64,
    c: i64,
    res: Vec<char>,
}

impl ABC {
    fn check(&self, s: &str) -> bool {
        let mut x = 0;
        if s.contains("A") {
            x += self.a;
        }
        if s.contains("B") {
            x += self.b;
        }
        if s.contains("C") {
            x += self.c;
        }
        x != 0
    }

    fn mv(&mut self, f: char, t: char) -> bool {
        match f {
            'A' => {
                if self.a == 0 {
                    return false;
                }
                self.a -= 1;
            }
            'B' => {
                if self.b == 0 {
                    return false;
                }
                self.b -= 1;
            }
            'C' => {
                if self.c == 0 {
                    return false;
                }
                self.c -= 1;
            }
            _ => {}
        }
        match t {
            'A' => self.a += 1,
            'B' => self.b += 1,
            'C' => self.c += 1,
            _ => {}
        }
        self.res.push(t);
        true
    }
}

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

    if a + b + c == 0 {
        println!("No",);
        return;
    }

    let mut abc = ABC {
        a: a,
        b: b,
        c: c,
        res: vec![],
    };

    if a + b + c == 1 {
        for s in s {
            if !abc.check(&s) {
                println!("No",);
                return;
            }
            if s == "AB" {
                if !abc.mv('A', 'B') {
                    abc.mv('B', 'A');
                }
            } else if s == "AC" {
                if !abc.mv('A', 'C') {
                    abc.mv('C', 'A');
                }
            } else {
                if !abc.mv('B', 'C') {
                    abc.mv('C', 'B');
                }
            }
        }
    } else {
        for w in s.windows(2) {
            if !abc.check(&w[0]) {
                println!("No");
                return;
            }
            if w[0] == "AB" {
                if w[1] == "BC" {
                    if !abc.mv('A', 'B') {
                        abc.mv('B', 'A');
                    }
                } else if w[1] == "AC" {
                    if !abc.mv('B', 'A') {
                        abc.mv('A', 'B');
                    }
                } else {
                    if !abc.mv('A', 'B') {
                        abc.mv('B', 'A');
                    }
                }
            } else if w[0] == "AC" {
                if w[1] == "AB" {
                    if !abc.mv('C', 'A') {
                        abc.mv('A', 'C');
                    }
                } else if w[1] == "BC" {
                    if !abc.mv('A', 'C') {
                        abc.mv('C', 'A');
                    }
                } else {
                    if !abc.mv('A', 'C') {
                        abc.mv('C', 'A');
                    }
                }
            } else {
                if w[1] == "AB" {
                    if !abc.mv('C', 'B') {
                        abc.mv('B', 'C');
                    }
                } else if w[1] == "AC" {
                    if !abc.mv('B', 'C') {
                        abc.mv('C', 'B');
                    }
                } else {
                    if !abc.mv('C', 'B') {
                        abc.mv('B', 'C');
                    }
                }
            }
        }
        let s = s.last().unwrap();
        if !abc.check(&s) {
            println!("No");
            return;
        }
        if s == "AB" {
            if !abc.mv('A', 'B') {
                abc.mv('B', 'A');
            }
        } else if s == "AC" {
            if !abc.mv('A', 'C') {
                abc.mv('C', 'A');
            }
        } else {
            if !abc.mv('B', 'C') {
                abc.mv('C', 'B');
            }
        }
    }
    println!("Yes",);
    for c in abc.res {
        println!("{}", c);
    }
}