#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll mod = 998244353;

template<ll mod>
struct Mint {
  using M=Mint; ll v;
  M& put(ll x) { v=(x<mod)?x:x-mod; return *this; }
  Mint(ll x=0) { put(x%mod+mod); }
  M operator+(M m) {return M().put(v+m.v);}
  M operator-(M m) {return M().put(v+mod-m.v);}
  M operator*(M m) {return M().put(v*m.v%mod);}
  M operator/(M m) {return M().put(v*m.inv().v%mod);}
// BEGIN IGNORE
  M operator+=(M m) { return put(v+m.v); }
  M operator-=(M m) { return put(v+mod-m.v); }
  M operator*=(M m) { return put(v*m.v%mod); }
  M operator/=(M m) { return put(v*m.inv().v%mod); }
// END IGNORE
  bool operator==(M m) { return v==m.v; }
  M pow(ll m) const {
    M x=v, res=1;
    while (m) {
      if (m&1) res=res*x;
      x=x*x; m>>=1;
    }
    return res;
  }
  M inv() { return pow(mod-2); }
};

using mint = Mint<mod>;

int main(){

  cin.tie(0);
  cin.sync_with_stdio(0);

  int n, m, w;
  cin >> n >> m >> w;
  vector<ll> a(n), b(m), c(m);
  for(int i = 0; i < n; ++i){
    cin >> a[i];
  }
  for(int j = 0; j < m; ++j){
    cin >> b[j];
  }
  for(int i = 0; i < m; ++i){
    cin >> c[i];
  }
  ll ans = 0;
  sort(a.begin(), a.end(), greater<>());
  vector<ll> r(n + 1);
  for(int i = 0; i < n; ++i){
    r[i + 1] = r[i] + a[i];
  }

  auto add = [&](ll rem){
    if(rem < r.size()){
      return r[rem];
    }
    else return r.back();
  };

  ll amax = *max_element(a.begin(), a.end());
  for(int i = 0; i < (1 << m); ++i){
    ll wei = 0, val = 0;
    for(int j = 0; j < m; ++j){
      if(i & (1 << j)){
        wei += b[j];
        val += c[j];
      }
    }
    if(wei <= w){
      ans = max(ans, add(w - wei) + val);
    }
  }
  cout << ans << endl;
}