#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'



signed main() {
    fio();
    ll n, x, y, z;
    cin >> n >> x >> y >> z;
    vl a(n);
    rep (i, n) {
        cin >> a[i];
        a[i]++;
    }

    sort(all(a));
    reverse(all(a));

    vl yen = {10000, 5000, 1000};
    vl num = {z, y, x};
    rep (j, 3) {
        rep (i, n) {
            if (num[j] == 0) break;
            ll p = a[i] / yen[j];
            if (p <= num[j]) {
                num[j] -= p;
                a[i] -= yen[j] * p;
            }
            else {
                p = num[j];
                num[j] -= p;
                a[i] -= yen[j] * p;
            }
        }

        if (num[j] > 0) {
            sort(all(a));
            reverse(all(a));
            for (int i = 0; i < n; i++) {
                if (num[j] == 0) break;
                a[i] = 0;
                num[j]--;
            }
        }
    }

    sort(all(a));
    if (a.back() <= 0) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }


    // rep (i, n) {
    //     ll t = a[i];
    //     ll p = t / 10000;
    //     if (p <= z) {
    //         z -= p;
    //         t -= 10000 * p;
    //     }
    //     else {
    //         p = z;
    //         z -= p;
    //         t -= 10000 * p;
    //     }

    //     p = t / 5000;
    //     if (p <= y) {
    //         y -= p;
    //         t -= 5000 * p;
    //     }
    //     else {
    //         p = y;
    //         y -= p;
    //         t -= 5000 * p;
    //     }

    //     p = t / 1000;
    //     if (p <= x) {
    //         x -= p;
    //         t -= 1000 * p;
    //     }
    //     else {
    //         p = x;
    //         x -= p;
    //         t -= 1000 * p;
    //     }

    //     if (t != 0) {
    //         if (t <= 1000 and x > 0) x--;
    //         else if (t <= 5000 and y > 0) y--;
    //         else if (t <= 10000 and z > 0) z--;
    //         else {
    //             cout << "No" << endl;
    //             return 0;
    //         }
    //     }
    // }
    // cout << "Yes" << endl;
}