import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

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

ans = 0
for bit in range(1<<(n+m)):
    v= 0
    posw = []
    negw = []
    for i in range(n+m):
        if not(bit>>i) & 1: continue
        if i < n:
            posw.append(a[i])
            v += b[i]
        else:
            negw.append(c[i-n])
            v -= d[i-n]
    posw.sort()
    posw = posw[::-1]
    negw.sort()
    now = 0
    ok = 1
    while posw:
        now += posw.pop()
        ok &= (0<=now<= W)
        while negw and negw[-1] <= now:
            now -= negw.pop()
    while negw:
        now -= negw.pop()
    ok &= (0<=now<= W)
    ans = max(ans, ok*v)

print(ans)