#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll 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;
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;
string alp="abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(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];
    ll c[n];
    rep(i,0,n-1){
        c[i]=(a[i])/1000+1;
    }
    for(ll i=0;i<n && z>0;i++){
        if(z>=c[i]/10){
            z-=c[i]/10;
            c[i]-=(c[i]/10)*10;
        }else{
            c[i]-=z*10;
            z=0;
        }
    }
    for(ll i=0;i<n && y>0;i++){
        if(y>=c[i]/5){
            y-=c[i]/5;
            c[i]-=(c[i]/5)*5;
        }else{
            c[i]-=y*5;
            y=0;
        }
    }
    if(y==0 && z==0){
        ll sum=0;
        rep(i,0,n-1)sum+=c[i];
        if(sum>x){
            cout<<"No"<<endl;
        }else{
            cout<<"Yes"<<endl;
        }
    }else if(y!=0 && z==0){
        sort(c,c+n);
        rep(i,0,n-1){
            if(x>=c[i]){
                x-=c[i];
                c[i]=0;
            }else{
                break;
            }
        }
        ll sum=0;
        rep(i,0,n-1){
            if(c[i]!=0){
                sum++;
            }
        }
        if(sum>y){
            cout<<"No"<<endl;
        }else{
            cout<<"Yes"<<endl;
        }
    }else if(y==0 && z!=0){
        sort(c,c+n);
        rep(i,0,n-1){
            if(x>=c[i]){
                x-=c[i];
                c[i]=0;
            }else{
                break;
            }
        }
        ll sum=0;
        rep(i,0,n-1){
            if(c[i]!=0){
                sum++;
            }
        }
        if(sum>z){
            cout<<"No"<<endl;
        }else{
            cout<<"Yes"<<endl;
        }
    }else{
        sort(c,c+n);
        rep(i,0,n-1){
            if(x>=c[i]){
                x-=c[i];
                c[i]=0;
            }else{
                break;
            }
        }
        ll sum=0;
        rep(i,0,n-1){
            if(c[i]!=0){
                sum++;
            }
        }
        if(sum>z+y){
            cout<<"No"<<endl;
        }else{
            cout<<"Yes"<<endl;
        }
    }
    
    
    
    return 0;
}