//Let's join Kaede Takagaki Fan Club !!
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}

int n;
ll x,y,z,a[100005];
int main(){
	ios::sync_with_stdio(false);
	g(n); g(x); g(y); g(z);
	rep(i,n) {
		g(a[i]);
		a[i]++;
	}
	auto process=[&](ll v, ll cnt){
		ll need = 0;
		rep(i,n) need += a[i] / v;
		if(need >= cnt){
			rep(i,n){
				a[i] -= min(cnt, a[i]/v) * v;
				cnt -= min(cnt, a[i]/v);
			}
			return;
		}
		else{
			rep(i,n){
				a[i] %= v;
			}
			cnt -= need;
			sort(a, a+n);
			for(int i=n-1;i>=0&&cnt;i--){
				a[i] = 0;
				cnt--;
			}
			return ;
		}
	};
	
	process(10000, z);
	process(5000, y);
	process(1000, x);
	rep(i,n){
		if(a[i] > 0){
			o("No"); return 0;
		}
	}
	o("Yes");
}