#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    vec<int> X(3);
    cin >> N >> X[0] >> X[1] >> X[2];
    vec<int> B = {1000,5000,10000};
    vec<int> A(N);
    bool ok = true;
    for(int i=0;i<N;i++){
        cin >> A[i];
        A[i]++;
    }
    for(int j=2;j>=0;j--){
        for(int i=0;i<N;i++){
            int n = min(A[i]/B[j],X[j]);
            A[i] -= n*B[j];
            X[j] -= n;
        }
        sort(A.begin(),A.end(),greater<int>());
        for(int i=0;i<N;i++) if(X[j]){
            A[i] = max(A[i]-B[j],0);
            X[j]--;
        }
    }
    cout << (all_of(A.begin(),A.end(),[](int i){return !i;})? "Yes\n":"No\n");
}