#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;
    ll x, y, z;
    cin >> n >> x >> y >> z;
    vector<ll> a(n);
    cin >> a;
    rep(i, n) a[i] = div_ceil(a[i] + 1, 1000) * 1000;
    sort(a.begin(), a.end());
    
    auto pay = [&](ll m){
        ll c10000 = min(z, m / 10000);
        m -= c10000 * 10000;
        z -= c10000;
        if (m <= 0) return true;
        
        ll c5000 = min(y, m / 5000);
        m -= c5000 * 5000;
        y -= c5000;
        if (m <= 0) return true;
        
        if (m <= x * 1000) {
            x -= m / 1000;
            return true;
        }
        if (m <= y * 5000) {
            y--;
            return true;
        }
        if (m <= z * 10000) {
            z--;
            return true;
        }
        return false;
    };
    
    rep(i, n) {
        if (!pay(a[i])) {
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
}