import sys
input = sys.stdin.readline

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

for i in range(M):
    C[i]=-C[i]
    D[i]=-D[i]

A+=C
B+=D

DP=[0]*(1<<(N+M))
DP[0]=1
ANS=0
for i in range(1<<(N+M)):
    if DP[i]==1:
        w=0
        v=0
        for j in range(N+M):
            if i & (1<<j) != 0:
                w+=A[j]
                v+=B[j]

        for j in range(N+M):
            if i & (1<<j) == 0:

                if 0<=w+A[j]<=W:
                    DP[i^(1<<j)]=1
                    ANS=max(ANS,v+B[j])
            
print(ANS)