import sys

sys.setrecursionlimit(10 ** 5)

from typing import List, Tuple


def int1(x: str, /): return int(x) - 1


def input(): return sys.stdin.readline().rstrip('\n')


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()), sep='; ', file=sys.stderr)


def main():
    a3, a2, a0 = map(int, input().split())
    db = int(input())
    b3, b2, b0 = map(int, input().split())
    dc = int(input())
    c3, c2, c0 = map(int, input().split())

    dp = {}

    def solve(v3, v2, v0):
        ret = dp.get((v3, v2, v0))
        if ret is not None:
            return ret
        ret = 0
        tb3 = min(db // 1000, v3)
        tb2 = min((db - tb3 * 1000) // 100, v2)
        tb0 = db - tb3 * 1000 - tb2 * 100
        if v0 >= tb0:
            ret = max(ret, 1 + solve(v3 - tb3 + b3, v2 - tb2 + b2, v0 - tb0 + b0))

        tc3 = min(dc // 1000, v3)
        tc2 = min((dc - tc3 * 1000) // 100, v2)
        tc0 = dc - tc3 * 1000 - tc2 * 100
        if v0 >= tc0:
            ret = max(ret, 1 + solve(v3 - tc3 + c3, v2 - tc2 + c2, v0 - tc0 + c0))
        dp[(v3, v2, v0)] = ret
        return ret

    return solve(a3, a2, a0)


def _start():
    ret = main()

    if ret is not None:
        if isinstance(ret, List) or isinstance(ret, Tuple):
            print(*ret)
        else:
            print(ret)


if __name__ == '__main__':
    _start()