#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;

int main(){
	cin.tie(0); ios::sync_with_stdio(false);
	
	ll n, x, y, z; cin >> n >> x >> y >> z;
	ll a[n]; zep(i, 0, n){cin >> a[i];}
	
	ll man = 10000;
	ll go = 5000;
	ll sen = 1000;

	zep(i, 0, n){
		if(a[i] >= man){
			ll buf = min(x, a[i]/man);
			a[i] -= buf*man;
			x -= buf;
		}
	}
	sort(a, a+n);
	rrep(i, n-1, 0){
		if(x > 0 && a[i] >= 0){
			a[i] -= man;
			x--;
		}
	}

	zep(i, 0, n){
		if(a[i] >= go){
			ll buf = min(y, a[i]/go);
			a[i] -= buf*go;
			y -= buf;
		}
	}
	sort(a, a+n);
	rrep(i, n-1, 0){
		if(y > 0 && a[i] >= 0){
			a[i] -= go;
			y--;
		}
	}

	zep(i, 0, n){
		if(a[i] >= sen){
			ll buf = min(z, a[i]/sen);
			a[i] -= buf*sen;
			z -= buf;
		}
	}
	sort(a, a+n);
	rrep(i, n-1, 0){
		if(z > 0 && a[i] >= 0){
			a[i] -= sen;
			z--;
		}
	}
	
	bool ans = true;
	zep(i, 0, n){
		if(a[i] >= 0){
			ans = false;
		}
	}
	print((ans)? "Yes" : "No")
	return 0;
}