#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long k;
  if (a == 0 || b == 0) {
    return 0;
  }
  while (1) {
    k = a % b;
    if (k == 0) {
      break;
    }
    a = b;
    b = k;
  }
  return b;
}
int prm[10000];
void sieve() {
  for (int k = 0; k <= 10000; k++) {
    prm[k] = 1;
  }
  prm[0] = 0;
  prm[1] = 0;
  for (int k = 2; k <= sqrtf(10000); k++) {
    if (prm[k] == 1) {
      for (int l = k * k; l <= 10000; l += k) {
        prm[l] = 0;
      }
    }
  }
}
long long power(long long val, long long pow) {
  if (pow <= 0) return 1;
  return val * power(val, pow - 1);
}
int main() {
  int a, b, c, d, e, f, g;
  cin >> a >> b >> c >> d >> e >> f;
  cin >> g;
  int minCup = ((a + b + c) + 4) / 5;
  int minMed = ((d + e + f) + 9) / 10;
  if (minCup + minMed <= g) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
