#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;
	}
	for(int i=0; i<n; i++){
		ll b=min(a[i]/10, z);
		a[i]-=b*10;
		z-=b;
	}
	if(z>=n){
		cout<<"Yes"<<endl;
		return 0;
	}
	sort(a, a+n);
	n-=z;
	for(int i=0; i<n; i++){
		ll b=min(a[i]/5, y);
		a[i]-=b*5;
		y-=b;
	}
	if(y>=n){
		cout<<"Yes"<<endl;
		return 0;
	}
	sort(a, a+n);
	n-=y;
	ll s=0;
	for(int i=0; i<n; i++) s+=a[i];
	if(s<=x) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}