#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define all(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))

int main() {
  int N, X, Y, Z;
  ins(N, X, Y, Z);

  vector<int> A(N);
  rep(i, N) {
    cin >> A[i];
    A[i] += A[i] % 1000 == 0;
    A[i] = ceil(A[i] / 1000.0) * 1000;
  }
  all(sort, A);
  rep(i, N) {
    // なるべくギリギリで払いたい
    if (Z * 10000 >= A[i]) {
      Z -= A[i] / 10000;
      A[i] -= (A[i] / 10000) * 10000;
      if (X * 1000 + Y * 5000 < A[i]) {
        // 1万を追加で使う
        --Z;
        continue;
      }
      Y -= A[i] / 5000;
      A[i] -= (A[i] / 5000) * 5000;
      if (X * 1000 < A[i]) {
        --Y;
        continue;
      }
      X -= ceil(A[i] / 1000.0);
      continue;
    }
    A[i] -= Z * 10000;
    Z = 0;
    if (Y * 5000 < A[i]) {
      A[i] -= Y * 5000;
      Y = 0;
      if (X * 1000 < A[i]) {
        cout << "No\n";
        return 0;
      }
      X -= ceil(A[i] / 1000.0);
      continue;
    }
    Y -= A[i] / 5000;
    A[i] -= (A[i] / 5000) * 5000;
    if (X * 1000 < A[i]) {
      --Y;
      continue;
    }
    X -= ceil(A[i] / 1000.0);
  }
  cout << "Yes\n";

  return 0;
}