#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,K,Q,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;

int main() {
    cin>>N;
    vec num(3);
    rep(i,3) cin>>num[i];
    vec a(N);
    vec value = {1, 5, 10};
    rep(i,N){
        cin>>a[i];
        a[i] = a[i] / 1000 + 1;
        ll minus = min(num[2], a[i] / value[2]);
        num[2] -= minus;
        a[i] -= value[2] * minus;
    }
    sort(ALL(a));
    reverse(ALL(a));
    rep(i,N){
        if(num[2] == 0) {
            break;
        }
        else {
            a[i] = 0;
            num[2]--;
        }
    }
    rep(i,N){
        ll minus = min(num[1], a[i] / value[1]);
        num[1] -= minus;
        a[i] -= value[1] * minus;
    }
    sort(ALL(a));
    reverse(ALL(a));
    rep(i,N){
        if(num[1] == 0) {
            break;
        }else{
            a[i] = 0;
            --num[1];
        }
    }
    ll sum = 0;
    rep(i,N) sum += a[i];
    cout<<(sum <= num[0] ? "Yes" : "No")<<endl;
}