#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
static const int MAX_N = 100000;

int N; ll X, Y, Z;
ll A[MAX_N];

int main(){
	scanf("%d %lld %lld %lld", &N, &X, &Y, &Z);
	for(int i = 0; i < N; i++){
		scanf("%lld", &A[i]);
		A[i]++;
	}
	for(int i = 0; i < N; i++){
		if(A[i] < 10000) continue;
		int num = min(Z, A[i] / 10000LL);
		Z -= num;
		A[i] -= num * 10000;
	}
	sort(A, A + N, greater<ll>());
	for(int i = 0; i < N; i++){
		if(Z == 0) break;
		A[i] = 0;
		Z--;
	}
	for(int i = 0; i < N; i++){
		if(A[i] < 5000) continue;
		int num = min(Y, A[i] / 5000LL);
		Y -= num;
		A[i] -= num * 5000;
	}
	sort(A, A + N, greater<ll>());
	for(int i = 0; i < N; i++){
		if(Y == 0) break;
		A[i] = 0;
		Y--;
	}
	for(int i = 0; i < N; i++){
		if(A[i] > X * 1000LL){
			printf("No\n");
			return 0;
		}
		X -= (A[i] % 1000LL == 0 ? A[i] / 1000LL : A[i] / 1000LL + 1);
	}
	printf("Yes\n");
	return 0;
}