import sys
sys.setrecursionlimit(10**6)

def read_data():
    a3, a2, a1 = map(int, input().split())
    db = int(input())
    b3, b2, b1 = map(int, input().split())
    dc = int(input())
    c3, c2, c1 = map(int, input().split())
    return a3, a2, a1, b3, b2, b1, c3, c2, c1, db, dc


def solve(a3, a2, a1, b3, b2, b1, c3, c2, c1, db, dc):
    memo = dict()
    dif_b = db - b3*1000 - b2*100 - b1
    dif_c = dc - c3*1000 - c2*100 - c1
    dif = min(dif_b, dif_c)
    record = 0

    def dfs(a3, a2, a1, depth):
        nonlocal record
        nonlocal memo
        if (a3, a2, a1) in memo:
            tmp = memo[a3, a2, a1]
            if tmp + depth > record:
                record = depth + tmp
            return tmp
        if (a3 * 1000 + a2 * 100 + a1) // dif < record - depth:
            return 0
        tmp = 0
        d3, d2, d1 = generate_payment_patterns(a3, a2, a1, db)
        if d3 or d2 or d1:
            t = dfs(a3-d3+b3, a2-d2+b2, a1-d1+b1, depth+1)
            if t > tmp:
                tmp = t
        d3, d2, d1 = generate_payment_patterns(a3, a2, a1, dc)
        if d3 or d2 or d1:
            t = dfs(a3-d3+c3, a2-d2+c2, a1-d1+c1, depth+1)
            if t > tmp:
                tmp = t
        memo[a3, a2, a1] = tmp
        if depth + tmp > record:
            record = depth + tmp
        return tmp + 1

    dfs(a3, a2, a1, 0)
    return record


def generate_payment_patterns(a3, a2, a1, d):
    for d3 in range(d//1000, -1, -1):
        if d3 > a3:
            continue
        for d2 in range((d - d3*1000)//100, -1, -1):
            if d2 > a2:
                continue
            d1 = d - d3*1000 - d2*100
            if d1 > a1:
                continue
            return d3, d2, d1
    return 0, 0, 0


if __name__ == '__main__':
    a3, a2, a1, b3, b2, b1, c3, c2, c1, db, dc = read_data()
    res1 = solve(a3, a2, a1, b3, b2, b1, c3, c2, c1, db, dc)
    res2 = solve(a3, a2, a1, c3, c2, c1, b3, b2, b1, dc, db)
    print(max(res1, res2))