#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 10
#else
#define SIZE 123450
#endif

int N,X,Y,Z;
int A[SIZE];

int calc(int base, int num) {
    REP(i,N) if (A[i]>0) {
        int cnt = min(A[i]/base, num);
        num -= cnt;
        A[i] -= cnt*base;
    }
    sort(A,A+N);
    reverse(A,A+N);
    REP(i,N) {
        while(num && A[i]>=0 && A[i]<base) {
            num--;
            A[i] -= base;
        }
    }
    return num;
}

bool ok() {
    if (X+Y+Z<0) return false;
    REP(i,N) {
        if (A[i]>=0) return false;
    }
    return true;
}

void solve() {
    cin>>N>>X>>Y>>Z;
    REP(i,N)cin>>A[i];
    Z = calc(10000, Z);
    Y = calc(5000, Y);
    X = calc(1000, X);
    if (ok()) {
        cout << "Yes" << endl;
    }else {
        cout << "No" << endl;
    }
}