import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); long w = sc.nextLong(); int[] values = new int[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } Arrays.sort(values); long[] sums = new long[n + 1]; for (int i = 1; i <= n; i++) { sums[i] = sums[i - 1] + values[n - i]; } int[] weights = new int[m]; for (int i = 0; i < m; i++) { weights[i] = sc.nextInt(); } int[] contains = new int[m]; for (int i = 0; i < m; i++) { contains[i] = sc.nextInt(); } long[] dpWeights = new long[1 << m]; long[] dp = new long[1 << m]; long ans = sums[(int)Math.min(w, n)]; for (int i = 1; i < (1 << m); i++) { for (int j = 0; j < m; j++) { if ((i & (1 << j)) == 0) { continue; } dpWeights[i] = dpWeights[i ^ (1 << j)] + weights[j]; dp[i] = dp[i ^ (1 << j)] + contains[j]; break; } if (w >= dpWeights[i]) { ans = Math.max(ans, dp[i] + sums[(int)Math.min(w - dpWeights[i], n)]); } } System.out.println(ans); } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }