/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,X,Y,Z;
    cin >> N >> X >> Y >> Z;
    ll A[100010];
    rep(i,0,N) cin >> A[i];
    rep(i,0,N){
        A[i] -= A[i] % 1000;
        A[i] += 1000;
    }
    sort(A, A+N, greater<ll>());
    rep(i,0,N){
        if(Z == 0) break;
        if(A[i] >= 10000){
            ll v = A[i] / 10000;
            if(Z >= v){
                Z -= v;
                A[i] %= 10000;
            }else{
                A[i] -= Z * 10000;
                Z = 0;
            }
        }
    }
    sort(A, A+N, greater<ll>());
    rep(i,0,N){
        if(Z == 0) break;
        if(A[i] > 0){
            Z--;
            A[i] = 0;
        }
    }

    rep(i,0,N){
        if(Y == 0) break;
        if(A[i] >= 5000){
            ll v = A[i] / 5000;
            if(Y >= v){
                Y -= v;
                A[i] %= 5000;
            }else{
                A[i] -= Y * 5000;
                Y = 0;
            }
        }
    }
    sort(A, A+N, greater<ll>());
    rep(i,0,N){
        if(Y == 0) break;
        if(A[i] > 0){
            Y--;
            A[i] = 0;
        }
    }
    bool ok = true;
    rep(i,0,N){
        if(A[i] > 0){
            ll v = A[i] / 1000;
            if(X < v){
                ok = false;
                break;
            }else{
                X -= v;
                A[i] = 0;
            }
        }
    }
    if(ok){
        print("Yes");
    }else{
        print("No");
    }
    

}