#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<pair<int,int>>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int N,M; ll 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 i = 0; i < M; i++) cin >> B[i];
  for(int i = 0; i < M; i++) cin >> C[i];
  // prep
  sort(A.begin(),A.end(),greater<ll>{});
  vector<ll> S(N+1);
  for(int i = 0; i < N; i++) S[i+1] = S[i] + A[i];
  
  // solve
  ll ans = 0;
  for(int bt = 0; bt < (1<<M); bt++){
    ll tmp = 0, wei = 0;
    for(int i = 0; i < M; i++){
      if(bt & (1<<i)){
        wei += B[i];
        tmp += C[i];
      }
    }
    
    if(wei > W) continue;
    
    ll can = min(max(0LL, W - wei),ll(N));
    tmp += S[can];
    chmax(ans,tmp);
  }
  
  // output
  cout << ans << endl;
}