//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  usize n = scan<usize>();
  u64 x = scan<u64>();
  u64 y = scan<u64>();
  u64 z = scan<u64>();
  std::vector<u64> a(n);
  for (auto &e : a) {
    std::cin >> e;
    e += 1;
  }
  for (auto &e : a) {
    u64 t = std::min(z, e / 10000);
    z -= t;
    e -= t * 10000;
  }
  std::sort(a.begin(), a.end());
  a.resize(n - std::min<usize>(n, z));
  n = a.size();
  for (auto &e : a) {
    u64 t = std::min(y, e / 5000);
    y -= t;
    e -= t * 5000;
  }
  std::sort(a.begin(), a.end());
  a.resize(n - std::min<usize>(n, y));
  n = a.size();
  for (auto &e : a) {
    u64 t = std::min(x, e / 1000);
    x -= t;
    e -= t * 1000;
  }
  std::sort(a.begin(), a.end());
  a.resize(n - std::min<usize>(n, x));
  std::cout << (std::all_of(a.begin(), a.end(), [](auto x) { return x == 0; })
                    ? "Yes"
                    : "No")
            << "\n";
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}