#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);
    int N;
    cin >> N;
    vector<ll> cnt(3), costs = {10000, 5000, 1000};
    rrep(i, 3, 0) {
        cin >> cnt[i];
    }
    vector<ll> A(N);
    for (auto& a : A) {
        cin >> a;
    }
    priority_queue<ll> que;
    for (auto a : A) {
        que.push(a);
    }
    rep(i, 0, 3) {
        while (cnt[i] > 0 && que.size()) {
            ll now = que.top();
            que.pop();
            ll M = min(cnt[i], (now + costs[i] - 1) / costs[i]);
            now -= costs[i] * M;
            cnt[i] -= M;
            if (now > 0) {
                que.push(now);
            }
        }
    }
    if (que.empty()) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    return 0;
}