//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, x, y, z;
vector<ll> a;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> x >> y >> z;
    priority_queue<ll> que;
    for (int i = 0; i < n; i++)
    {
        ll temp;
        cin >> temp;
        a.push_back(temp);
        que.push(temp);
    }
    while (z)
    {
        if(que.empty()){
            yes;
            return 0;
        }
        else if (z >= que.top() / 10000 && que.top() >= 10000)
        {
            z -= que.top() / 10000;
            ll temp=que.top()%10000;
            que.pop();
            que.push(temp);
        }
        else if (que.top() >= 10000){
            ll temp = que.top() -z* 10000;
            z=0;
            que.pop();
            que.push(temp);
        }
        else{
            z--;
            que.pop();
        }
    }
    while(y){
        if (que.empty())
        {
            yes;
            return 0;
        }
        else if (y >= que.top() / 5000 && que.top() >= 5000)
        {
            y -= que.top() / 5000;
            ll temp = que.top() % 5000;
            que.pop();
            que.push(temp);
        }
        else if (que.top() >= 5000)
        {
            ll temp = que.top() - y * 5000;
            y = 0;
            que.pop();
            que.push(temp);
        }
        else
        {
            y--;
            que.pop();
        }
    }
    while(x){
        if (que.empty())
        {
            yes;
            return 0;
        }
        ll temp=(que.top()+999)/1000;
        que.pop();
        x-=temp;
        if(x<0){
            no;
            return 0;
        }
    }
    if (que.empty())
    {
        yes;
        return 0;
    }
    no;
}