from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
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()))
N += M
A += [-i for i in C]
B += [-i for i in D]
INF = (1<<60)
dp = [-INF]*(1<<N)
dp[0] = 0
def is_ok(val):
    return 0<=val<=W
ans = 0
val = [0]*(1<<N)
for i in range(1<<N):
    if dp[i]==-INF:
        continue
    for j in range(N):
        if (i>>j)&1:
            continue
        else:
            if is_ok(dp[i]+A[j]):
                dp[i|(1<<j)] = dp[i]+A[j]
                val[i|(1<<j)] = val[i]+B[j]
                ans = max(ans,val[i|(1<<j)])
print(ans)