#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    ll n, x, y, z;
    cin >> n >> x >> y >> z;

    vector <ll> th(5);
    ll five = 0;
    ll ten = 0;

    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        a = a / 1000 + 1;

        ten += a / 10;
        a %= 10;

        five += a / 5;
        a %= 5;

        th[a]++;
    }

    for (int i = 1; i < 5; i++) {
        if (x >= th[i] * i) {
            x -= th[i] * i;
        } else {
            th[i] -= x / i;
            x = 0;
            if (y >= th[i]) {
                y -= th[i];
            } else {
                th[i] -= y;
                y = 0;
                if (z >= th[i]) {
                    z -= th[i];
                } else {
                    cout << "No\n";
                    return 0;
                }
            }
        }
    }

    y += x / 5;
    five -= y;
    if (five > 0) z -= five;

    z += y / 2;
    ten -= z;
    if (ten > 0) {
        cout << "No\n";
    } else {
        cout << "Yes\n";
    }

    return 0;
}