#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}

template<class T, class Cond>
struct chain {
  Cond cond; chain(Cond cond) : cond(cond) {}
  bool operator()(T& a, const T& b) const {
    if(cond(a, b)) { a = b; return true; }
    return false;
  }
};
template<class T, class Cond>
chain<T, Cond> make_chain(Cond cond) { return chain<T, Cond>(cond); }

int main() {
  i64 N, X, Y, Z;
  cin >> N >> X >> Y >> Z;
  vector<i64> A(N);
  rep(i,0,N) {
    cin >> A[i];
    A[i] = A[i] / 1000 + 1;
  }

  rep(i,0,N) {
    i64 n = A[i] / 10;
    if(n <= Z) {
      Z -= n;
    }
    else if(n * 10 <= Y * 5 + X) {
      i64 y = std::min(Y, n * 2);
      Y -= y;
      X -= n * 10 - y * 5;
    }
    else {
      std::cout << "No" << endl;
      return 0;
    }
    A[i] %= 10;
  }

  sort(all(A));
  rep(i,0,N) {
    if(A[i] >= 5) {
      if(Y > 0) {
        Y--;
        A[i] -= 5;
      }
      else if(Z > 0) {
        Z--;
        A[i] = 0;
      }
    }
  }
  sort(all(A));
  reverse(all(A));
  rep(i,0,N) {
    if(A[i] > 0) {
      if(Y > 0) {
        Y--;
        A[i] = 0;
      }
      else if(Z > 0) {
        Z--;
        A[i] = 0;
      }
      else if(A[i] <= X) {
        X -= A[i];
        A[i] = 0;
      }
      else {
        cout << "No" << endl;
        return 0;
      }
    }
  }
  cout << "Yes" << endl;
}