#include <bits/stdc++.h>
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
template<class T, class U> inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; }

ll n, x[3], a[100000];
ll mul[3] = { -1,5,2 };
using pll = pair<ll, ll>;

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  cin >> n;
  rep(i, 3) cin >> x[i];
  rep(i, n) cin >> a[i];
  vector<pll> b(n);
  ll sum = 0;
  rep(i, n) {
    if(a[i]%1000 == 0) a[i]++;
    ll c = (a[i]+999)/1000;
    b[i] = {c%mul[1], c/mul[1]};
    sum += c;
  }
  sort(b.rbegin(), b.rend());
  vector<ll> na(n, 0);
  rep(i, n) {
    if(sum <= x[0]) break;
    if(sum-b[i].second*mul[1] >= x[0]) {
      sum -= b[i].second*mul[1];
      na[i] += b[i].second;
    }
    else {
      ll t = (sum-x[0]+mul[1]-1)/mul[1];
      sum -= t*mul[1];
      na[i] += t;
    }
  }
  rep(i, n) {
    if(sum <= x[0]) break;
    sum -= b[i].first;
    na[i]++;
  }

  sum = 0;
  rep(i, n) {
    b[i] = {na[i]%mul[2], na[i]/mul[2]};
    sum += na[i];
  }
  sort(b.rbegin(), b.rend());
  na.assign(n, 0);
  rep(i, n) {
    if(sum <= x[1]) break;
    if(sum-b[i].second*mul[2] >= x[1]) {
      sum -= b[i].second*mul[2];
      na[i] += b[i].second;
    }
    else {
      ll t = (sum-x[1]+mul[2]-1)/mul[2];
      sum -= t*mul[2];
      na[i] += t;
    }
  }
  rep(i, n) {
    if(sum <= x[1]) break;
    sum -= b[i].first;
    na[i]++;
  }

  sum = 0;
  rep(i, n) {
    sum += na[i];
  }
  cout << (sum > x[2] ? "No" : "Yes") << '\n';
  return 0;
}