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**15
dp = [[[-INF for _ in range(W+1)] for _ in range(1<<(N+M))] for _ in range(N+M+1)]
dp[0][0][0] = 0
for i in range(N+M):
    for j in range(1<<(N+M)):
        for w in range(W+1):
            if dp[i][j][w]==-INF:
                continue
            for k in range(N+M):
                if (j>>k)&1:
                    continue
                dp[i+1][j][w] = max(dp[i+1][j][w], dp[i][j][w])
                if k<N:
                    a = A[k]
                    b = B[k]
                    if 0<=w+a<=W:
                        dp[i+1][j|(1<<k)][w+a] = max(dp[i+1][j|(1<<k)][w+a], dp[i][j][w]+b)
                else:
                    c = C[k-N]
                    d = D[k-N]
                    if 0<=w-c<=W:
                        dp[i+1][j|(1<<k)][w-c] = max(dp[i+1][j|(1<<k)][w-c], dp[i][j][w]-d)

ans = 0
for j in range(1<<(N+M)):
    ans = max(ans, max(dp[N+M][j]))
print(ans)