#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,ll> P;

ll d[32][32];
ll now[510][510];
ll r[3]={0,1,2};

ll cost[5][35];

int main(){
    ll n,x,y,z;
    cin>>n>>x>>y>>z;
    vector<ll>a(n);
    ll sum = 0;
    for(ll i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a.begin(),a.end(),greater<ll>());
    for(ll i=0;i<n;i++){
        if(z==0)break;
        else{
            if(a[i]>=10000){
                ll k = a[i]/10000;
                if(z>=k){
                    z-=k;
                    a[i]-=10000*k;
                }
                else{
                    z=0;
                    a[i]-=10000*z;
                }
            }
            else break;
        }
    }
    sort(a.begin(),a.end(),greater<ll>());
    for(ll i=0;i<n;i++){
        if(z==0)break;
        if(a[i]>=0){
            a[i]-=10000;
            z--;
        }
    }
    sort(a.begin(),a.end(),greater<ll>());
    for(ll i=0;i<n;i++){
        if(y==0)continue;
        else{
            if(a[i]>=5000){
                ll k = a[i]/5000;
                if(y>=k){
                    y-=k;
                    a[i]-=5000*k;
                }
                else{
                    y=0;
                    a[i]-=5000*z;
                }
            }
            else break;
        }
    }
    sort(a.begin(),a.end(),greater<ll>());
    for(ll i=0;i<n;i++){
        if(y==0)break;
        if(a[i]>=0){
            a[i]-=5000;
            y--;
        }
    }
    sort(a.begin(),a.end(),greater<ll>());
    for(ll i=0;i<n;i++){
        if(a[i]<0)continue;
        if(x==0)continue;
        else{
            if(a[i]>=1000){
                ll k = a[i]/1000+1;
                if(y>=k){
                    y-=k;
                    a[i]-=1000*k;
                }
                else{
                    y=0;
                    a[i]-=1000*z;
                }
            }
            else{
                a[i]-=1000;
                y--;
            }
        }
    }
    for(ll i=0;i<n;i++){
        if(a[i]>=0){
            cout<<"No"<<endl;
            return 0;
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}