#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
//const ll mod = 1000000007;

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N, X, Y, Z;
    cin >> N >> X >> Y >> Z;
    vector<ll> A(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
        A[i]++;
        ll num = min(Z, A[i] / 10000);
        Z -= num;
        A[i] -= 10000 * num;
    }
    sort(A.begin(), A.end(), greater<ll>());
    for(int i = 0; i < A.size(); i++) {
        if(Z > 0) {
            A[i] -= 10000;
            Z--;
        }
        //cerr << A[i] << endl;
    }
    vector<ll> B;
    for(int i = 0; i < A.size(); i++) {
        if(A[i] <= 0) continue;
        ll num = min(Y, A[i] / 5000);
        B.push_back(A[i] - 5000 * num);
        Y -= num;
    }
    sort(B.begin(), B.end(), greater<ll>());
    N = B.size();
    for(int i = 0; i < B.size(); i++) {
        if(Y > 0) {
            B[i] -= 5000;
            Y--;
        }
        if(B[i] <= 0) continue;
        X -= (B[i] + 999) / 1000;
        //cerr << B[i] << " " << X << endl;
    }
    if(X >= 0) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}