#include <bits/stdc++.h>
const long long mod = 1000000007;
using namespace std;
bool isPrime(int n) {
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  int a, b, c, d, e, f, n;
  cin >> a >> b >> c;
  cin >> d >> e >> f >> n;
  if (ceil((float)(a + b + c) / 5) + ceil((float)(d + e + f) / 10) > n)
    cout << "NO"
         << "\n";
  else
    cout << "YES"
         << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
