import sys, time, random from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 import time t1 = time.time() n, m, w = mi() a = li() b = li() c = [v for v in li()] d = [v for v in li()] ans = 0 import itertools WV = [] for x, y in zip(a, b): WV.append((x, y)) for x, y in zip(c, d): WV.append((-x, -y)) def solve(WV, w): n = len(WV) dp = [[-inf] * (w + 1) for _ in range(n + 1)] dp[0][0] = 0 for i in range(n): x, y = WV[i] for j in range(w + 1): if 0 <= j + x <= w: dp[i + 1][j + x] = max(dp[i + 1][j + x], dp[i][j] + y) dp[i + 1][j] = max(dp[i][j], dp[i + 1][j]) return max(dp[n]) ans = 0 while time.time() - t1 <= 0.7: random.shuffle(WV) ans = max(ans, solve(WV, w)) for bit1 in range(1 << n): for bit2 in range(1 << m): WV = [] p = 0 for i in range(n): if 1 & (bit1 >> i): WV.append((a[i], b[i])) p += b[i] if ans >= p: break WIS = [] for i in range(m): if 1 & (bit2 >> i): WIS.append((c[i], d[i])) p -= d[i] if ans >= p: break for WV in itertools.permutations(WV): for WIS in itertools.permutations(WIS): j = 0 noww = 0 nowv = 0 for x, y in WV: noww += x nowv += y if noww > w: nowv = -inf break if j < len(WIS) and WIS[j][0] <= noww: noww -= WIS[j][0] nowv -= WIS[j][1] j += 1 ans = max(ans, nowv) print(ans)