#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool solve(int n, ll x, ll y, ll z, vector<ll>& a) {
    for (int i = 0; i < n; ++i) {
        ll cnt = min(a[i] / 10000, z);
        z -= cnt;
        a[i] -= 10000 * cnt;
    }

    // < 10000
    for (int i = 0; i < n; ++i) {
        if (a[i] >= 5000 && z > 0) {
            a[i] -= 10000;
            --z;
        }
    }
    y += z;

    for (int i = 0; i < n; ++i) {
        if (a[i] <= 0) continue;
        ll cnt = min(a[i] / 5000, y);
        y -= cnt;
        a[i] -= 5000 * cnt;
    }

    // < 5000
    for (int i = 0; i < n; ++i) {
        if (a[i] >= 1000 && y > 0) {
            a[i] -= 5000;
            --y;
        }
    }
    x += y;

    for (int i = 0; i < n; ++i) {
        if (a[i] < 0) continue;
        x -= a[i] / 1000 + 1;
    }
    if (x < 0) return false;

    return true;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    ll x, y, z;
    cin >> n >> x >> y >> z;
    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    cout << (solve(n, x, y, z, a) ? "Yes" : "No") << "\n";
    return 0;
}