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()))
A.sort(reverse=True)
Ac = [0] * (N + 1)
for i in range(N):
    Ac[i + 1] = Ac[i] + A[i]
    
M2 = 1 << M
ans = 0
for s in range(M2):
    b, c = 0, 0
    for i in range(M):
        if (s >> i) & 1:
            b += B[i]
            c += C[i]
    if b > W:
        continue
    ans = max(ans, c + Ac[min(N, W - b)])
    
print(ans)