#include<iostream>
#include<vector>
#include<string>
#include<queue>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return 0;}
template<typename T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return 0;}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N, X, Y, Z;
    cin >> N >> X >> Y >> Z;
    vector<ll> A(N);
    for (auto& a : A) {
        cin >> a;
    }
    priority_queue<ll> que;
    for (auto a : A) {
        que.push(a);
    }
    while (Z > 0 && que.size()) {
        ll a = que.top();
        que.pop();
        if (a == 0) {
            --X;
            continue;
        }
        ll M = min(Z, (a + 9999) / 10000);
        Z -= M;
        a -= 10000 * M;
        if (a >= 0) {
            que.push(a);
        }
    }
    while (Y > 0 && que.size()) {
        ll a = que.top();
        que.pop();
        if (a == 0) {
            --X;
            continue;
        }
        ll M = min(Y, (a + 4999) / 5000);
        Y -= M;
        a -= 5000 * M;
        if (a >= 0) {
            que.push(a);
        }
    }
    while (X > 0 && que.size()) {
        ll a = que.top();
        que.pop();
        if (a == 0) {
            --X;
            continue;
        }
        ll M = min(X, (a + 999) / 1000);
        X -= M;
        a -= 1000 * M;
        if (a >= 0) {
            que.push(a);
        }
    }
    if (que.size()) {
        cout << "No" << endl;
    }
    else {
        cout << "Yes" << endl;
    }
    return 0;
}