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(reverse=1)
T=[0]*(n+1)
for i in range(n):
	T[i+1]+=T[i]
	T[i+1]+=A[i]
	
ans=0

for bit in range(2**m):
	W,V=0,0
	for i in range(m):
		if bit>>i&1:
			W+=B[i]
			V+=C[i]
	if W<=w:
		ans=max(ans,V+T[min(w-W,n)])
print(ans)