#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
// } ;
} fio;

bool solve(){
	
	int N, X, Y, Z;
	int sum = 0, con = 0;
	vector<int> A;
	vector<int> B;
	bool flag = true;
	
	cin>>N>>X>>Y>>Z;
	
	A.resize(N);
	B.resize(N);
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
		
		A[i]++;
		
		sum += A[i];
		
		con += A[i] / 10000;
		
		B[i] = A[i] % 10000;
	}
	
	if(sum > X * 1000 + Y * 5000 + Z * 10000){
		return false;
		// flag = false;
	}
	
	
	
	// cout<<"con = "<<con<<endl;
	{
		int a, b, c;
		
		a = min(Z, con);
		
		Z   -= a;
		con -= a;
		
		b = min(Y/2, con);
		
		Y   -= b * 2;
		con -= b;
		
		if(Y && X >= 5 && con) {
			Y--;
			X -= 5;
			con--;
		}
		
		c = min(X/10, con);
	
		X   -= c * 10;
		con -= c;
	}
	// cout<<"con = "<<con<<endl;
	
	// cout<<"X = "<<X<<" Y = "<<Y<<" Z = "<<Z<<endl;
	
	if(con) {
		return false;
	}
	
	sort(B.begin(), B.end(), greater<int>());
	
	for(int i = 0; i < Z && i < N; i++){
		B[i] = 0;
	}
	
	sum = 0, con = 0;
	
	for(int i = 0; i < N; i++){
		// if(B[i].second % 1000 == 0) B[i].second++;
		
		sum += B[i];
		
		con += B[i] / 5000;
		
		B[i] = B[i] % 5000;
	}
	
	// cout<<"con = "<<con<<endl;
	
	sort(B.begin(), B.end(), greater<int>());
	
	if(sum > X * 1000 + Y * 5000 + Z * 10000){
		return false;
	}
	
	{
		int a, b, c;
		
		b = min(Y, con);
		
		Y   -= b;
		con -= b;
		
		
		c = min(X/5, con);
	
		X   -= c * 5;
		con -= c;
	}
	// cout<<"con = "<<con<<endl;
	if(con) {
		return false;
	}
	
	for(int i = 0; i < Y && i < N; i++){
		B[i] = 0;
	}
	
	for(int i = 0; i < N; i++){
		
		X -= (B[i] + 1000 - 1) / 1000;
	}
	
	if(X < 0) return false;
	
	return true;
}

signed main(){
	
	if(solve()) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}