a1, a2, a3 = [int(i) for i in input().split()]
b1, b2, b3 = [int(i) for i in input().split()]
b = int(input())
k = 0
if (a1+a2+a3) % 5 == 0:
k+=(a1+a2+a3)//5
else:
f = (a1+a2+a3)//5
k += f+1
if (b1+b2+b3) % 10 == 0:
k += (b1+b2+b3)//10
else:
h = (b1+b2+b3)//10
k += h +1
if k <= b:
print("YES")
else:
print("NO")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n, a1, a2, a3, a, b1, b2, b3, b;
cin >> a1 >> a2 >> a3;
cin >> b1 >> b2 >> b3;
cin >> n;
a = a1 + a2 + a3;
b = b1 + b2 + b3;
a = ceil(a * 1.0 / 5);
b = ceil(b * 1.0 / 10);
if ((a + b) <= n)
cout << "YES";
else
cout << "NO";
return 0;
}
507B - Amr and Pins | 379A - New Year Candles |
1154A - Restoring Three Numbers | 750A - New Year and Hurry |
705A - Hulk | 492B - Vanya and Lanterns |
1374C - Move Brackets | 1476A - K-divisible Sum |
1333A - Little Artem | 432D - Prefixes and Suffixes |
486A - Calculating Function | 1373B - 01 Game |
1187A - Stickers and Toys | 313B - Ilya and Queries |
579A - Raising Bacteria | 723A - The New Year Meeting Friends |
302A - Eugeny and Array | 1638B - Odd Swap Sort |
1370C - Number Game | 1206B - Make Product Equal One |
131A - cAPS lOCK | 1635A - Min Or Sum |
474A - Keyboard | 1343A - Candies |
1343C - Alternating Subsequence | 1325A - EhAb AnD gCd |
746A - Compote | 318A - Even Odds |
550B - Preparing Olympiad | 939B - Hamster Farm |