N,M,W = list(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)
sA = [0]*(N+1)
for i in range(N):
    sA[i+1] = A[i] + sA[i]
ans = 0
for i in range(1<<M):
    s = bin(i + (1<<M))[3:]
    w = 0
    v = 0
    flag = True
    for j in range(M):
        if s[j] == "1":
            w += B[j]
            v += C[j]
            if w > W:
                flag = False
                break
    if flag:
        ans = max(v+sA[min(W-w, N)], ans)
print(ans)