#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
//*/
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());


void solve(){
  int n,m; ll w,ans = 0; cin >> n >> m >> w;
  vll a(n); rep(i,n) cin >>a[i];
  sort(ALL(a));
  reverse(ALL(a));
  vll b(m),c(m); rep(i,m) cin >> b[i]; rep(i,m) cin >> c[i];
  vll s(n+1,0);
  rep(i,n) s[i+1] = s[i]+a[i];
  int m2 = 1<<m;
  rep(bit,m2){
    ll bs = 0,cs = 0;
    rep(i,m)if(bit>>i&1) bs+=b[i],cs+=c[i];
    if(w-bs >= 0)chmax(ans,s[min((int)(w-bs),n)]+cs);
  }
  cout << ans << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(dirc,t) solve();
}