#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

int main() {
    int n,x,y,z;
    cin >> n >> x >> y >> z;
    vector<int> a(n);
    for (int i=0; i<n; i++) cin >> a[i];
    sort(a.rbegin(), a.rend());

    for (int i=0; i<n; i++) {
        if (a[i] >= 5000) {
            int _z = min(z, a[i]/10000);
            a[i] -= 10000 * _z;
            z -= _z;
        }
    }


    sort(a.rbegin(), a.rend());
    for (int i=0; i<n; i++) {
        if (a[i] >= 1000) {
            int _y = min(y, a[i]/5000+1);
            a[i] -= 5000 * _y;
            y -= _y;
        }
    }


    sort(a.rbegin(), a.rend());
    for (int i=0; i<n; i++) {
        if (a[i] >= 0) {
            int _x = min(x, a[i]/1000+1);
            a[i] -= 1000 * _x;
            x -= _x;
        }
    }



    auto cmp = [](int x){return x<0;};
    bool ans = all_of(a.begin(), a.end(), cmp);
    cout << (ans? "Yes" : "No") << endl;
}