#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;
  priority_queue<ll> v;
  rep(i,N){
    ll a;
    cin >> a;
    v.push(a+1);
  }

  while(Z>0){
    if(v.empty()) break;
    ll a = v.top();

    if(a > 10000){
      v.pop();
      ll y = min(a/10000, Z);
      a -= y * 10000;
      Z -= y;
      v.push(a);
    }else break;
  }
  while(Z>0){
    if(v.empty()) break;
    ll a = v.top(); v.pop();
    Z--;
  }
  while(Y>0){
    if(v.empty()) break;
    ll a = v.top();

    if(a > 5000){
      v.pop();
      ll y = min(a/5000, Y);
      a -= y * 5000;
      Y -= y;
      v.push(a);
    }else break;
  }
  while(Y>0){
    if(v.empty()) break;
    ll a = v.top(); v.pop();
    Y--;
  }
  while(X>0){
    if(v.empty()) break;
    ll a = v.top(); v.pop();
    ll y = min((a+999)/1000, X);
    X -= y;
    if(a - y * 1000 > 0) v.push(a);
  }

  if(v.empty()) cout << "Yes" << endl;
  else cout << "No" << endl;
  
  return 0;
}