#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n,m,sz;
    cin >> n >> m >> sz;
    vector<ll> a(n),b(m),c(m);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    rep(i,m) cin >> c[i];
    sort(all(a));
    reverse(all(a));
    vector<ll> sum(n+1,0);
    rep(i,n) sum[i+1]=sum[i]+a[i];
    ll ans=0;
    rep(i,1<<m){
        ll w=0,v=0;
        rep(j,m){
            if(i&1<<j){
                w+=b[j];
                v+=c[j];
            }
        }
        ll x=sz-w;
        if(x<0) continue;
        chmax(ans,v+sum[min(n,x)]);
    }
    cout << ans << '\n';
}