#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <functional>
#include <cstring>
#include <regex>
#include <random>
#include <cassert>
#include <stack>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, s, n) for (int i = (s); i < (int)(n); i++)
#define revrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define revrepr(i, s, n) for (int i = (n) - 1; i >= s; i--)
#define debug(x) cerr << #x << ": " << x << "\n"
#define popcnt(x) __builtin_popcount(x)

using ll = long long;
using P = pair<int, int>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T>
istream& operator >>(istream &is, vector<T> &v) {
    for (int i = 0; i < (int)v.size(); i++) cin >> v.at(i);
    return is;
}

template<class T, class U>
ostream& operator <<(ostream &os, pair<T, U> p) {
    cout << '(' << p.first << ", " << p.second << ')';
    return os;
}

template<class T>
void print(const vector<T> &v, const string &delimiter) { rep(i, v.size()) cout << (0 < i ? delimiter : "") << v.at(i); cout << endl; }

template<class T>
void print(const vector<vector<T>> &vv, const string &delimiter) { for (const auto &v: vv) print(v, delimiter); }

ll div_ceil(ll x, ll d) { return (x + d - 1) / d; }

int main() {
    int n;
    vector<ll> c(3);
    cin >> n >> c;
    vector<ll> a(n);
    cin >> a;
    rep(i, n) a[i] = div_ceil(a[i] + 1, 1000) * 1000;

    priority_queue<ll> que;
    rep(i, n) que.push(a[i]);
    
    int ptr = 2;
    vector<ll> v = {1000, 5000, 10000};
    while (!que.empty()) {
        ll m = que.top(); que.pop();
        while (0 <= ptr && c[ptr] == 0) ptr--;
        if (ptr == -1) {
            cout << "No" << endl;
            return 0;
        }
        
        if (v[ptr] <= m) {
            ll use = min(c[ptr], m / v[ptr]);
            m -= use * v[ptr];
            c[ptr] -= use;
        }
        else {
            ll use = min(c[ptr], div_ceil(m, v[ptr]));
            m -= use * v[ptr];
            c[ptr] -= use;
        }
        
        if (0 < m) que.push(m);
    }
    cout << "Yes" << endl;
}