n,m,w=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
a.reverse()
sm=[0]
for i in a:sm.append(sm[-1]+i)

b=list(map(int,input().split()))
c=list(map(int,input().split()))

ans=0
for S in range(1<<m):
    wsum=0
    vsum=0
    for i in range(m):
        if S>>i&1:
            wsum+=b[i]
            vsum+=c[i]
    if wsum>w:continue
    vsum+=sm[min(n,w-wsum)]
    ans=max(ans,vsum)
print(ans)