import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

A,B,C,D,E,F,G=map(int,readline().split())
ans="NO"
for a in range(A+1):
    for b in range(B+1):
        for c in range(C+1):
            for d in range(D+1):
                for e in range(E+1):
                    for f in range(F+1):
                        if 500*a+100*b+50*c+10*d+5*e+f==G:
                            ans="YES"
print(ans)