#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;
    ll X, Y, Z;
    cin >> N >> X >> Y >> Z;

    vi cnt(10);
    vll A(N);
    rep(i, N) {
        cin >> A[i];
        A[i] = (A[i] + 1000) / 1000;

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

    X = min(10ll * N, X);
    Y = min(2ll * N, Y);
    Z = min(1ll * N, Z);

    for (int i = 0; i <= Y; ++i) {
        int x = (int)X;
        int y = (int)(Y - i);
        int z = (int)Z;
        vi C = cnt;
        for (int j = 4; j >= 1; --j) {
            int d = min(y, C[j]);
            C[j] -= d;
            y -= d;
        }

        bool ok = true;
        for (int j = 9; j >= 1; --j) {
            int d = min(z, C[j]);
            C[j] -= d;
            z -= d;

            d = min(x/j, C[j]);
            C[j] -= d;
            x -= d * j;
            
            if (C[j] > 0) {
                ok = false;
                break;
            }
        }
        if (ok) {
            cout << "Yes" << endl;
            return;
        }
        
        for (int j = 5; j <= 9; ++j) {
            if (cnt[j]) {
                cnt[j]--;
                cnt[j - 5]++;
                break;
            }
        }
    }

    cout << "No" << endl;
}

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