#include <iostream>
#include <queue>

using namespace std;

int main(){
  long long n,x,y,z;cin>>n>>x>>y>>z;
  priority_queue<long long> A;
  for(int i = 0; n > i; i++){
    long long s;cin>>s;
    A.push(s+1);
  }
  while(A.size()){
    auto k = A.top();A.pop();
    if(10000 < k && z){
      long long use = min(k/10000,z);
      A.push(k-10000*use);z -= use;
      continue;
    }
    if(5000 < k){
      if(z){
        z--;
        continue;
      }
      if(y){
        long long use = min(k/5000,y);
        A.push(k-5000*use); y -= use;
        continue;
      }
    }
    if(1000 < k){
      if(z){
        z--;
        continue;
      }
      if(y){
        y--;
        continue;
      }
      if(x){
        long long use = min(k/1000,x);
        A.push(k-1000*use); x -= use;
        continue;
      }
    }
    if(z){
      z--;
      continue;
    }
    if(y){
      y--;
      continue;
    }
    if(x){
      x--;
      continue;
    }
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
}