import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n, m, w = LI()
aa = LI()
bb = LI()
cc = LI()
dd = LI()

def chmax(i, j, val):
    if val > dp[i][j]: dp[i][j] = val

dp = [[0]*(w+1) for _ in range(1 << n+m)]
for s in range(1 << n+m):
    for i in range(n):
        if s >> i & 1: continue
        for t in range(w):
            if t+aa[i] > w: break
            chmax(s | 1 << i, t+aa[i], dp[s][t]+bb[i])
    for i in range(m):
        a, b = cc[i], dd[i]
        i += n
        if s >> i & 1: continue
        for t in range(w+1)[::-1]:
            if t-a < 0: break
            chmax(s | 1 << i, t-a, dp[s][t]-b)

ans=0
for s in range(1<<n+m):
    ans=max(ans,max(dp[s]))
print(ans)