#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, m, w;
  cin >> n >> m >> w;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  vector<ll> b(m);
  rep(i, m) cin >> b[i];
  vector<ll> c(m);
  rep(i, m) cin >> c[i];
  sort(a.begin(), a.end());
  reverse(a.begin(), a.end());
  vector<ll> sum(n + 1);
  rep(i, n) sum[i + 1] = sum[i] + a[i];
  ll ans = 0;
  rep(S, 1 << m) {
    ll now_b = 0, now_c = 0;
    rep(mi, m) if ((S >> mi) & 1) {
      now_b += b[mi];
      now_c += c[mi];
    }
    if (now_b <= w) {
      now_c += sum[min(n, w - now_b)];
      ans = max(ans, now_c);
    }
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}