#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    array<int32_t, 6> cs;
    int32_t g;
    for (auto i = 0; i < 6; ++i) {
        cin >> cs[i];
    }
    cin >> g;
    array<int32_t, 6> xs = {500, 100, 50, 10, 5, 1};
    for (auto i = 0; i < 6; ++i) {
        g -= min(cs[i], g / xs[i]) * xs[i];
        if (g == 0) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}