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()))
a.sort()
a.reverse()
a=[0]+a
for i in range(n):
  a[i+1]+=a[i]
g=0
for i in range(1<<m):
  g1=0
  g2=0
  for j in range(m):
    g1+=((i>>j)&1)*b[j]
    g2+=((i>>j)&1)*c[j]
  if g1<=w:
    g=max(g,g2+a[min(n,w-g1)])
print(g)