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()))
d=list(map(int,input().split()))
X=1<<60
q=[[-X]*(W+1) for i in range(1<<(n+m))]
q[0][0]=0
for i in range(1<<(n+m)):
  for j in range(W+1):
    for k in range(n):
      if (i>>k)&1==0:
        w,v=a[k],b[k]
        if j+w<=W:
          q[i|(1<<k)][j+w]=max(q[i|(1<<k)][j+w],q[i][j]+v)
    for k in range(m):
      if (i>>(n+k))&1==0:
        w,v=c[k],d[k]
        if 0<=j-w:
          q[i|(1<<(n+k))][j-w]=max(q[i|(1<<(n+k))][j-w],q[i][j]-v)
print(max(max(q[i]) for i in range(1<<(n+m))))