#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  int N, M; long long W; cin >> N >> M >> W;
  vector<long long> A(N), B(M), C(M);
  
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }

  sort(A.rbegin(), A.rend());
  vector<long long> S(N + 1, 0);
  for (int i = 0; i < N; i++) {
    S[i + 1] = S[i] + A[i];
  }
  
  for (long long &inner: B) cin >> inner;
  for (long long &inner: C) cin >> inner;
  
  long long ans = W > N ? S[N] : S[(int)W];
  for (int i = 0; i < 1 << M; i++) {
    long long w = 0;
    long long v = 0;
    for (int j = 0; j < M; j++) {
      if (i >> j & 1) {
	v += C[j];
	w += B[j];
      }
    }

    if (w > W) {
      continue;
    }

    long long r = W - w;
    v += r > N ? S[N] : S[(int)r];
    ans = max(ans, v);
  }
  cout << ans << endl;
  return 0;
}