#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];
        if(a[i]>=10000){
            ll t = a[i]/10000;
            sum+=t;
            a[i]-=t*10000;
        }
    }
    if(sum<=z)z-=sum;
    else{
        sum-=z;
        z=0;
        if(2*sum<=y){
            y-=2*sum;
        }
        else{
            ll tmp = y/2;
            y-=tmp;
            sum-=2*tmp;
            if(10*sum<=x)x-=10*sum;
            else{
                cout<<"No"<<endl;
            }
        }
    }
    for(ll i=0;i<n;i++){
        if(z>0){
            z--;
            a[i]=0;
            continue;
        }
        else break;
    }
    sum = 0;
    for(ll i=0;i<n;i++){
        if(a[i]>=5000){
            sum+=1;
            a[i]-=5000;
        }
    }
    if(sum<=y)y-=sum;
    else{
        sum-=y;
        y=0;
        if(5*sum<=x){
            x-=5*sum;
        }
        else{
            cout<<"No"<<endl;
            return 0;
        }
    }
    for(ll i=0;i<n;i++){
        if(a[i]<=0)continue;
        if(y>0){
            y--;
            continue;
        }
        if(a[i]>0){
            if(x<=0){
                cout<<"No"<<endl;
                return 0;
            }
            else{
                ll cnt = a[i]/1000;
                if(cnt%2!=0)cnt++;
                x-=cnt;
                if(x<=0){
                    cout<<"No"<<endl;
                    return 0;
                }
            }
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}