#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 p[] = { 500, 100, 50, 10, 5, 1 };
vector<i64> a, dp;
i64 g;

int main() {
  read_n(a, 6);
  cin >> g;
  init_n(dp, g + 1);
  dp[0] = 1;
  for (i64 k = 0; k < 6; ++k) {
    auto dp_to = dp;
    for (i64 i = 0; i <= a[k]; ++i) {
      i64 x = p[k] * i;
      for (i64 j = 0; j <= g - x; ++j) {
        dp_to[j + x] += dp[j];
      }
    }
    dp = dp_to;
  }
  cout << (dp[g] ? "YES" : "NO") << '\n';
  return 0;
}