#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;


int main(){
  ll N, X, Y, Z;
  cin >> N >> X >> Y >> Z;
  vector<pair<ll,ll>> v;
  rep(i,N){
    ll a;
    cin >> a;
    a++;
    ll b = (a+999)/1000;
    v.emplace_back(b/5,b%5);
  }

  sort(ALLOF(v), [](const pair<ll,ll>& x, const pair<ll,ll>& y){
    return x.second<y.second;
  });

  rep(i,N){
    pair<ll,ll> x = v[i];
    ll a = x.second;
    ll b = min(a, X);
    v[i].second -= b;
    X -= b;
  }
  rep(i,N){
    if(v[i].second > 0) v[i].first++;
  }

  sort(ALLOF(v), [](const pair<ll,ll>& x, const pair<ll,ll>& y){
    return x.first<y.first;
  });
  
  rep(i,N){
    ll a = v[i].first;
    ll b = min(a, Y);
    v[i].first -= b;
    Y -= b;
  }
  rep(i,N){
    ll a = (v[i].first+1)/2;
    ll b = min(a, Z);
    v[i].first -= b;
    Z -= b;
  }

  bool ok = true;
  rep(i,N){
    if(v[i].first > 0) ok = false;
  }
  
  
  if(ok) cout << "Yes" << endl;
  else cout << "No" << endl;
  
  return 0;
}