#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, X, Y, Z;
    cin >> N >> X >> Y >> Z;
    vector<int> A(N);
    REP(i,N) cin >> A[i];
    sort(A.rbegin(), A.rend());
    string ans = "Yes";
    REP(i,N){
        int z = min((A[i] + 9999)/ 10000, Z);
        A[i] -= z * 10000;
        Z -= z;
        if(A[i] <= 0) continue;
        int y = min(A[i] / 5000, Y);
        A[i] -= y * 5000;
        Y -= y;
        if(A[i] > 2000 && Y > 0){
            Y--;
        }
        else{
            int x = min((A[i] + 999)/ 1000, X);
            A[i] -= x * 1000;
            X -= x;
            if(A[i] > 0){
                ans = "No";
                break;
            }
        }
    }
    cout << ans << endl;
}