#include <bits/stdc++.h>
//#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
//template<class T>void max(T a,T b){if(a<b)return b;else return a;}
//template<class T>void min(T a,T b){if(a>b)return b;else return a;}
//template<class T>bool Max(T&a, T b){if(a < b){a = b;return 1;}return 0;}
//template<class T>bool Min(T&a, T b){if(a > b){a = b;return 1;}return 0;}

//////////////////////////

int main(){fastio
    ll n,x,y,z;cin>>n>>x>>y>>z;
    ll a[n];rep(i,0,n-1)cin>>a[i];
    rep(i,0,n-1){
        a[i]=a[i]/1000+1;
    }
    //rep(i,0,n-1)cout<<a[i]<<" ";cout<<endl;
    rep(i,0,n-1){
        ll c=a[i]/10;
        if(c<=z){
            a[i]-=c*10;
            z-=c;
        }else{
            a[i]-=z*10;
            z-=z;
        }
    }
    if(z>0){
        ll b[n];rep(i,0,n-1)b[i]=a[i];
        sort(b,b+n);
        if(z>=n){
            cout<<"Yes"<<endl;return 0;
        }
        for(ll i=n-1;i>=n-z;i--)b[i]=0;
        rep(i,0,n-1)a[i]=b[i];
    }
    rep(i,0,n-1){
        ll c=a[i]/5;
        if(c<=y){
            a[i]-=c*5;
            y-=c;
        }else{
            a[i]-=y*5;
            y-=y;
        }
    }
    if(y>0){
        ll b[n];rep(i,0,n-1)b[i]=a[i];
        sort(b,b+n);
        if(y>=n){
            cout<<"Yes"<<endl;return 0;
        }
        for(ll i=n-1;i>=n-y;i--)b[i]=0;
        rep(i,0,n-1)a[i]=b[i];
    }
    
    rep(i,0,n-1){
        ll c=a[i];
        if(c<=x){
            a[i]-=c;
            x-=c;
        }else{
            a[i]-=x;
            x-=x;
        }
    }
    rep(i,0,n-1){
        if(a[i]>0){
            cout<<"No"<<endl;return 0;
        }
    }
    cout<<"Yes"<<endl;
    
    return 0;
}