#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

void solve() {
    
    int N, X, Y, Z;
    cin >> N >> X >> Y >> Z;

    vi cnt(10);
    rep(i, N) {
        int a;
        cin >> a;
        a = (a + 1000) / 1000;

        if (a >= 10) {
            int d = min(a / 10, Z);
            a -= d * 10;
            Z -= d;
            d = min(a / 10, Y / 2);
            a -= d * 10;
            Y -= d * 2;
            d = min(a / 10, X / 10);
            a -= d * 10;
            X -= d * 10;
        }
        if (a >= 10) {
            cout << "No" << endl;
            return;
        } else if (a > 0) {
            cnt[a]++;
        }
    }

    for (int i = 9; i >= 1; --i) {
        int d = min(cnt[i], Z);
        cnt[i] -= d;
        Z -= d;
    }

    for (int i = 9; i >= 1; --i) {
        int d = min(cnt[i], Y);
        cnt[i] -= d;
        Y -= d;
        if (i > 5)cnt[i - 5] += d;
    }

    for (int i = 9; i >= 1; --i) {
        int d = min(cnt[i], X);
        cnt[i] -= d;
        X -= d;
        if (cnt[i] > 0) {
            cout << "No" << endl;
            return;
        }
        if (i > 0)cnt[i - 1] += d;
    }

    cout << "Yes" << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}