#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

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.begin(),a.end(),[](const int& a,const int& b)->bool{return (a+1)%5000 < (b+1)%5000;});
    for (int i = 0;i < n;++i) {
        int j = ((a[i]+1)%5000+999)/1000;
        if (x >= j) {
            x -= j;
            a[i] -= j*1000;
        } else break;
    }
    y += x/5;
    sort(a.begin(),a.end(),[](const int& a,const int& b)->bool{return (a+1)%10000 < (b+1)%10000;});
    for (int i = 0;i < n;++i) if (a[i] >= 0) {
        int j = ((a[i]+1)%10000+4999)/5000;
        if (y >= j) {
            y -= j;
            a[i] -= j*5000;
        } else break;
    }
    z += y/2;
    for (int i = 0;i < n;++i) if (a[i] >= 0) {
        int j = ((a[i]+1)+9999)/10000;
        if (z >= j) {
            z -= j;
            a[i] -= j*10000;
        } else break;
    }
    bool ok = true;
    for (int i = 0;i < n;++i) if (a[i] >= 0) ok = false;
    cout << (ok ? "Yes" : "No") << endl;
}