n,m,k = 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()))
ac = a+[-w for w in c]
bd = b+[-v for v in d]
f = [False]*(1<<n+m); f[0] = True; v = [0]*(1<<n+m)
for i in range(1<<n+m):
    if not f[i]: continue
    s = 0
    for j in range(n+m):
        if i>>j&1: s += ac[j]
    for j in range(n+m):
        if i>>j&1: continue
        if 0<=s+ac[j]<=k:
            f[i|1<<j] = True
            v[i|1<<j] = max(v[i|1<<j],v[i]+bd[j])
print(max(v))