#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;
  }

  vector<pair<i64, i64>> vec(N);
  rep(i,0,N) {
    vec[i].first = A[i] % 5;
    vec[i].second = i;
  }
  sort(all(vec));
  for(auto p: vec) {
    if(p.first <= X) {
      X -= p.first;
      A[p.second] /= 5;
    }
    else {
      A[p.second] /= 5;
      A[p.second] += 1;
    }
  }
  Y += X / 5;
  rep(i,0,N) {
    vec[i].first = A[i] % 2;
    vec[i].second = i;
  }
  sort(all(vec));
  for(auto p: vec) {
    if(p.first <= Y) {
      Y -= p.first;
      A[p.second] /= 2;
    }
    else {
      A[p.second] /= 2;
      A[p.second] += 1;
    }
  }
  Z += Y / 2;
  rep(i,0,N) {
    if(A[i] <= Z) {
      Z -= A[i];
    }
    else {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}