#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.begin(), a.end());

    bool ans = true;
    for (int i=0; i<n; i++) {
        if (a[i] < 1000*min(x,4)) {
            x -= min(x,4);
        } else if (a[i] < 5000 * min(y,1)) {
            y -= min(y,1);
        } else if (a[i] < 1000*min(x,4) + 5000*min(y,1)) {
            a[i] -= 5000 * min(y,1);
            y -= min(y,1);
            x -= max(0, (a[i]+1000) / 10000);
        } else if (a[i] < 1000*min(x,4) + 5000*min(y,1) + 10000*min(z,1)) {
            a[i] -= 10000 * min(z,1);
            z -= min(z,1);
            a[i] -= 5000 * min(y,1);
            y -= min(y,1);
            x -= max(0, (a[i]+1000) / 1000);
        } else if (a[i] < 1000 * x) {
            x -= (a[i] / 1000) + 1;
        } else if (a[i] < 5000 * y) {
            y -= (a[i] / 5000) + 1;
        } else if (a[i] < 10000 * z) {
            z -= (a[i] / 100000) + 1;
        } else {
            ans = false;
        }
    }

    cout << (ans? "Yes" : "No") << endl;
}