#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    ll n,x,y,z;cin>>n>>x>>y>>z;
    vector<ll> a(n);
    rep(i,n){
        cin>>a[i];
        a[i]++;
        a[i]=(a[i]+999)/1000;
    }

    // aを1000で切り上げ除算しとく
    // 1,5,10
    // 10で払えるだけ払う，10が余ればmod10の降順で払う
    // 5でも同様
    rep(i,n){
        ll ne=a[i]/10;
        ll pay=min(ne,z);
        a[i]-=10*pay;
        z-=pay;
    }
    if(z){
        sort(ALL(a),[](ll lhs,ll rhs){
            return lhs%10>rhs%10;
        });
        for(int i=0;i<n and z;i++) a[i]=0,z--;
    }
    rep(i,n){
        ll ne=a[i]/5;
        ll pay=min(ne,y);
        a[i]-=5*pay;
        y-=pay;
    }
    if(y){
        sort(ALL(a),[](ll lhs,ll rhs){
            return lhs%5>rhs%5;
        });
        for(int i=0;i<n and y;i++) a[i]=0,y--;
    }
    ll sum=0;
    rep(i,n) sum+=a[i];
    cout<<(x>=sum?"Yes":"No")<<endl;
    return 0;
}