#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n, x, y, z;
    cin >> n >> x >> y >> z;
    ll a[n];
    rep(i,n)cin >> a[i];
    sort(a,a+n);

    rep(i,n){
        ll tmp = min(z, a[i] / 10000);
        a[i] -= tmp * 10000;
        z -= tmp;
        tmp = min(y, a[i] / 5000);
        a[i] -= tmp * 5000;
        y -= tmp;
        if(a[i] > 0) x -= (a[i] - 1) / 1000 + 1;
    }

    if(x >= 0)yn;
    return 0;
}