#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,x,y,z;
  cin>>n>>x>>y>>z;
  vector<ll> A(n);
  rep(i,n){
    cin>>A[i];
    A[i]++;
  }
  sort(ALL(A));
  reverse(ALL(A));
  rep(i,n){
    ll t=min(A[i]/10000,z);
    A[i]-=t*10000;
    z-=t;
  }
  sort(ALL(A));
  reverse(ALL(A));
  rep(i,n){
    ll t=min(A[i]/5000,y);
    A[i]-=t*5000;
    y-=t;
  }
  sort(ALL(A));
  reverse(ALL(A));
  ll sum=0;
  rep(i,n){
    if(z && A[i]){
      z--;
      A[i]=0;
    }
    else if(y && A[i]){
      y--;
      A[i]=0;
    }
    else if(A[i]){
      sum+=(A[i]+999)/1000;
    }
  }
  if(sum<=x) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  
  return 0;
}