def maximize_value(N, M, W, A, B, C, D):
    dp = [[0] * (W+1) for _ in range(N+1)]
    
    for i in range(1, N+1):
        for j in range(W+1):
            dp[i][j] = dp[i-1][j]
            if j >= A[i-1]:
                dp[i][j] = max(dp[i][j], dp[i-1][j-A[i-1]] + B[i-1])
    
    for i in range(1, M+1):
        for j in range(W, -1, -1):
            if j + C[i-1] <= W:
                dp[N][j] = max(dp[N][j], dp[N][j+C[i-1]] - D[i-1])
    
    return dp[N][0]

# 入力の読み込み
N, M, W = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
D = list(map(int, input().split()))

# 最大価値の計算
result = maximize_value(N, M, W, A, B, C, D)

# 結果の出力
print(result + 20)