/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.21 02:30:44
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n,x,y,z;cin >> n >> x >> y >> z;
    priority_queue<int> pq;
    for (int i = 0; i < n; i++) {
        int a;cin >> a;
        pq.push(a+1);
    }
    while(!pq.empty()) {
        int p = pq.top(); pq.pop();
        if (p >= 10000 && z >= p/10000) {
            z-=p/10000;
            p%=10000;
            pq.push(p);
        }
        else if (p >= 10000 && z > 0) {
            p -= z * 10000;
            z = 0;
            pq.push(p);
        }
        else if (z > 0) {
            z -= (p + 9999) / 10000;
        }
        else if (p >= 5000 && y >= p/5000) {
            y-=p/5000;
            p%=5000;
            pq.push(p);
        }
        else if (p >= 5000 && y > 0) {
            p -= y * 5000;
            y = 0;
            pq.push(p);
        }
        else if (y > 0) {
            y -= (p + 4999) / 5000;
        }
        else if (x >= (p + 999) / 1000) {
            x-=(p + 999) / 1000;
        }
        else {
            
            puts("No");
            return 0;
        }
    }
    puts("Yes");
    return 0;
}