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()))

INF = 10**18
V = [[-INF for _ in range(w + 1)] for _ in range(1 << (n + m))]
V[0][0] = 0
ans = 0
for bit in range(1 << (n + m)):
    for ww in range(w + 1):
        if V[bit][ww] != -INF:
            for i in range(n + m):
                if (bit >> i) & 1:
                    continue
                nbit = bit | (1 << i)
                if i < n:
                    if ww + A[i] <= w:
                        V[nbit][ww + A[i]] = max(V[nbit][ww + A[i]], V[bit][ww] + B[i])
                else:
                    if ww - C[i - n] >= 0:
                        V[nbit][ww - C[i - n]] = max(V[nbit][ww - C[i - n]], V[bit][ww] - D[i - n])
    for ww in range(w + 1):
        ans = max(ans, V[bit][ww])
print(ans)