import bisect

def knapsack(N, M, W, A, B, C):
    dp = [0] * (W + 1)
    for i in range(N):
        for w in range(W, 0, -1):
            if w - 1 >= 0:
                dp[w] = max(dp[w], dp[w - 1] + A[i])

    items = [(b, c) for b, c in zip(B, C) if b <= W]
    items.sort()

    BIT = [0] * (W + 2)
    for w in range(W + 1):
        BIT[w + 1] = max(BIT[w + 1], dp[w])
        if w < W:
            BIT[w + 2] = max(BIT[w + 2], dp[w])

    for i in range(len(items)):
        b, c = items[i]
        if i > 0 and items[i - 1][0] == b:
            continue
        for w in range(W, b - 1, -1):
            dp[w] = max(dp[w], dp[w - b] + c)
            BIT[w + 1] = max(BIT[w + 1], dp[w])
            if w < W:
                BIT[w + 2] = max(BIT[w + 2], dp[w])

    return dp[W]
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()))
print(knapsack(N, M, W, A, B, C))