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: Wrong Answer)

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($t:tt),*; $n:expr) => {{
		let stdin = ::std::io::stdin();
		let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
			let line = line.unwrap();
			let mut it = line.split_whitespace();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
	};
	($it:ident; [usize1]) => {
		$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
	};
	($it:ident; [$t:ty]) => {
		$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
	};
	($it:ident; $t:ty) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}

pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/2;

fn solve() {
    let (n,a,b,c) = read!(usize,i64,i64,i64);
    let s = read!(String;n);
    if s[0]=="AB" && a==0 && b==0 {
        println!("No");
        return;
    }
    if s[0]=="AC" && a==0 && c==0 {
        println!("No");
        return;
    }
    if s[0]=="BC" && b==0 && c==0 {
        println!("No");
        return;
    }
    if a+b+c>=3 {
        println!("Yes");
        let mut ca = a;
        let mut cb = b;
        let mut cc = c;
        for i in 0..n {
            if s[i]=="AB" {
                if ca<cb {
                    println!("A");
                    ca += 1;
                    cb -= 1;
                }
                else {
                    println!("B");
                    ca -= 1;
                    cb += 1;
                }
            }
            if s[i]=="AC" {
                if ca<cc {
                    println!("A");
                    ca += 1;
                    cc -= 1;
                }
                else {
                    println!("C");
                    ca -= 1;
                    cc += 1;
                }
            }
            if s[i]=="BC" {
                if cb<cc {
                    println!("B");
                    cb += 1;
                    cc -= 1;
                }
                else {
                    println!("C");
                    cb -= 1;
                    cc += 1;
                }
            }
        }
        return;
    }
    let mut dp = vec![vec![vec![vec![(0,0,0);4];4];4];n+1];
    dp[0][a as usize][b as usize][c as usize] = (1,1,1);
    for i in 0..n {
        for a in 0..4 {
            for b in 0..4 {
                for c in 0..4 {
                    if dp[i][a][b][c]==(0,0,0) {
                        continue;
                    }
                    if s[i]=="AB" {
                        if b>0 {
                            dp[i+1][a+1][b-1][c] = (1,-1,0);
                        }
                        if a>0 {
                            dp[i+1][a-1][b+1][c] = (-1,1,0);
                        }
                    }
                    if s[i]=="AC" {
                        if a>0 {
                            dp[i+1][a-1][b][c+1] = (-1,0,1);
                        }
                        if c>0 {
                            dp[i+1][a+1][b][c-1] = (1,0,-1);
                        }
                    }
                    if s[i]=="BC" {
                        if b>0 {
                            dp[i+1][a][b-1][c+1] = (0,-1,1);
                        }
                        if c>0 {
                            dp[i+1][a][b+1][c-1] = (0,1,-1);
                        }
                    }
                }
            }
        }
    }
    let mut ans = vec![(0,0,0);n];
    for a in 0..4 {
        for b in 0..4 {
            for c in 0..4 {
                if dp[n][a][b][c]==(0,0,0) {
                    continue;
                }
                // println!("{} {} {}", a, b, c);
                let mut ca = a;
                let mut cb = b;
                let mut cc = c;
                for k in (0..n).rev() {
                    let (da,db,dc) = dp[k+1][ca][cb][cc];
                    // println!("{} {} {} {} {} {}", ca, cb, cc, da, db, dc);
                    ans[k] = (da,db,dc);
                    ca = (ca as i64 - da) as usize;
                    cb = (cb as i64 - db) as usize;
                    cc = (cc as i64 - dc) as usize;
                }
            }
        }
    }
    if ans.len()==0 {
        println!("No");
        return;
    }
    println!("Yes");
    for (a,b,c) in ans {
        if a==1 {
            println!("A");
        }
        if b==1 {
            println!("B");
        }
        if c==1 {
            println!("C");
        }
    }
}

fn run() {
    solve();
}