#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n; ll x, y, z;
	cin>>n>>x>>y>>z;
	ll a[100010];
	for(int i=0; i<n; i++){
		cin>>a[i];
		a[i]=a[i]/1000+1;
	}
	ll s1=0;
	for(int i=0; i<n; i++){
		ll b=a[i]/10;s1+=b;
	}
	if(s1>=z){
		sort(a, a+n);
		for(int i=0; i<n; i++){
			ll b=a[i]/10;
			a[i]-=min(b, z)*10;
			z-=min(b, z);
		}
		sort(a, a+n);
		for(int i=0; i<n; i++){
			ll b=a[i]/5;
			a[i]-=min(b, y)*5;
			y-=min(b, y);
		}
		sort(a, a+n);
		for(int i=0; i<n; i++){
			ll b=a[i];
			a[i]-=min(b, x);
			x-=min(b, x);
		}
		if(x){
			cout<<"Yes"<<endl;
			return 0;
		}
		int cnt=0;
		for(int i=0; i<n; i++) if(a[i]) cnt++;
		if(cnt<=y+z){
			cout<<"Yes"<<endl;
		}else{
			cout<<"No"<<endl;
		}
		return 0;
	}
	z-=s1;
	if(z>=n){
		cout<<"Yes"<<endl;
		return 0;
	}
	for(int i=0; i<n; i++){
		a[i]%=10;
	}
	sort(a, a+n);
	int k=lower_bound(a, a+n, 5)-a;
	ll s[100010];
	s[0]=0;
	for(int i=0; i<n; i++) s[i+1]=s[i]+a[i];
	ll c[5]={};
	for(int i=0; i<n-z; i++){
		c[a[i]%5]++;
	}
	for(int i=max(z-n+k, 0ll); i<=min(z, (ll)k); i++){
		if(n-k<z-i) continue;
		if(y<=n-k-(z-i)){
			if(x>=s[k-i]-s[k]+s[n-z+i]-y*5){
				cout<<"Yes"<<endl;
				return 0;
			}
		}else{
			ll y1=y-(n-k-z+i);
			ll c1[5];
			for(int j=0; j<5; j++) c1[j]=c[j];
			for(int j=4; j>=0; j--){
				ll l=min(y1, c1[j]);
				c1[j]-=l;
				y1-=l;
			}
			ll s3=0;
			for(int j=0; j<5; j++) s3+=c1[j]*j;
			if(s3<=x){
				cout<<"Yes"<<endl;
				return 0;
			}
		}
		if(i==min(z, (ll)k)) break;
		c[a[k-1-i]%5]--;
		c[a[n-z+i]%5]++;
	}
	cout<<"No"<<endl;
	return 0;
}