from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque,Counter
from math import ceil, floor, sqrt, factorial,gcd
from itertools import permutations, combinations,product
from bisect import bisect_left, bisect_right
from copy import deepcopy
from functools import lru_cache #@lru_cache(maxsize=None)
from fractions import Fraction
from copy import deepcopy
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline
vector1 = [[0, -1], [1, 0], [0, 1], [-1, 0]]
vector2 = [[0, 1], [1, 0], [-1, 0], [0, -1],
           [1,-1], [-1, 1], [1, 1], [-1, -1]]




def main():
    
    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 = True)
    
    dp = defaultdict(int)
    dp[0] = 0
    for i in range(M):
        ndp = defaultdict(int)
        for key in dp.keys():
            ndp[key] = dp[key]
            if key + B[i] <= W:
                ndp[key + B[i]] = dp[key] + C[i]
        dp = ndp
        #print(dp,ndp)
    
    s = [0]
    for a in A:
        s.append(s[-1] + a)
    
    ans = 0
    for key in dp.keys():
        space = W - key
        
        ans = max(dp[key]+s[min(space,N)],ans)
    print(ans)
    


if __name__ == '__main__':
    main()