import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    def buy(m1000,m100,m1,p,bc1000,bc100,bc1):
        r1000=min(m1000,p//1000)
        p-=1000*r1000
        r100=min(m100,p//100)
        p-=100*r100
        if p>m1:return -1,-1,-1
        return m1000-r1000+bc1000,m100-r100+bc100,m1-p+bc1

    #解説見ちゃった
    a1000,a100,a1=MI()
    s=1000*a1000+100*a100+a1
    mx1000=s//1000+1
    mx100=s//100+1
    db=II()
    b1000,b100,b1=MI()
    dc=II()
    c1000,c100,c1=MI()
    #dp[i][m1000][m100] iおつかいの回数　j残千円　k残百円
    dp=[[[-1]*(mx100+1) for _ in range(mx1000+1)] for _ in range(s+1)]
    dp[0][a1000][a100]=a1
    mx=0
    for i in range(s+1):
        for m1000 in range(mx1000,-1,-1):
            for m100 in range(mx100,-1,-1):
                m1=dp[i][m1000][m100]
                if m1==-1:continue
                n1000,n100,n1=buy(m1000,m100,m1,db,b1000,b100,b1)
                if n1!=-1:
                    dp[i+1][n1000][n100]=max(dp[i+1][n1000][n100],n1)
                    mx=i+1
                n1000,n100,n1=buy(m1000,m100,m1,dc,c1000,c100,c1)
                if n1!=-1:
                    dp[i+1][n1000][n100]=max(dp[i+1][n1000][n100],n1)
                    mx=i+1
    print(mx)

main()