#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>
#include <array>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << "\e[0m" << endl;
    exit(1);
  }
  int size = distance(begin(container), end(container));
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N;
  array<Z, 3> As;
  cin >> N >> As;
  if (ix(As, 0) + ix(As, 1) + ix(As, 2) == 2) {
    vector dp(N + 1, vector(3, vector(3, vector<char>(3, '\0'))));
    ix(dp, 0, ix(As, 0), ix(As, 1), ix(As, 2)) = 'X';
    vector<string> command(N);
    for (auto i = 0; i < N; i++) {
      string s;
      cin >> s;
      ix(command, i) = s;
      for (auto a = 0; a < 3; a++) {
        for (auto b = 0; b < 3; b++) {
          for (auto c = 0; c < 3; c++) {
            if (!ix(dp, i, a, b, c)) {
              continue;
            }
            if (s == "AB") {
              if (a > 0) {
                ix(dp, i + 1, a - 1, b + 1, c) = 'B';
              }
              if (b > 0) {
                ix(dp, i + 1, a + 1, b - 1, c) = 'A';
              }
            }
            else if (s == "BC") {
              if (b > 0) {
                ix(dp, i + 1, a, b - 1, c + 1) = 'C';
              }
              if (c > 0) {
                ix(dp, i + 1, a, b + 1, c - 1) = 'B';
              }
            }
            else {
              if (c > 0) {
                ix(dp, i + 1, a + 1, b, c - 1) = 'A';
              }
              if (a > 0) {
                ix(dp, i + 1, a - 1, b, c + 1) = 'C';
              }
            }
          }
        }
      }
    }
    for (auto a = 0; a < 3; a++) {
      for (auto b = 0; b < 3; b++) {
        for (auto c = 0; c < 3; c++) {
          if (!ix(dp, N, a, b, c)) continue;
          string ans;
          Z x = a, y = b, z = c;
          for (auto i = N; i >= 1; i--) {
            ans += ix(dp, i, x, y, z);
            if (ix(dp, i, x, y, z) == 'A') {
              x--;
              (ix(command, i - 1) == "AB" ? y : z)++;
            }
            else if (ix(dp, i, x, y, z) == 'B') {
              y--;
              (ix(command, i - 1) == "AB" ? x : z)++;
            }
            else {
              z--;
              (ix(command, i - 1) == "AC" ? x : y)++;
            }
          }
          reverse(begin(ans), end(ans));
          cout << "Yes" << '\n';
          for (auto&& c : ans) {
            cout << c << '\n';
          }
          return 0;
        }
      }
    }
    cout << "No" << '\n';
  }
  else {
    string ans;
    for (auto i = 0; i < N; i++) {
      string s;
      cin >> s;
      Z j = 0;
      if (s == "AC") {
        j = 1;
      }
      else if (s == "AB") {
        j = 2;
      }
      if (ix(As, (j + 1) % 3) == 0 && ix(As, (j + 2) % 3) == 0) {
        cout << "No" << '\n';
        return 0;
      }
      Z k = ix(As, (j + 1) % 3) > ix(As, (j + 2) % 3) ? (j + 1) % 3 : (j + 2) % 3;
      dump(k);
      ix(As, k)--;
      for (auto l = 0; l < 3; l++) {
        if (l == j || l == k) continue;
        dump(l);
        ix(As, l)++;
        ans += 'A' + l;
      }
      dump(As);
    }
    cout << "Yes" << '\n';
    for (auto&& c : ans) {
      cout << c << '\n';
    }
  }
}



Measured memory_bytes: 68388