#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> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n,m,w;
    cin >> n >> m >> w;
    vector<ll> a(n),b(n),c(m),d(m);
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    rep(i,m) cin >> c[i];
    rep(i,m) cin >> d[i];
    vector<vector<ll>> dp(1<<(n+m),vector<ll>(w+1,-INF));
    dp[0][0]=0;
    rep(i,1<<(n+m)){
        rep(j,w+1){
            rep(l,n){
                if(i&(1<<l)) continue;
                if(j+a[l]<=w) chmax(dp[i|(1<<l)][j+a[l]],dp[i][j]+b[l]);
                chmax(dp[i|(1<<l)][j],dp[i][j]);
            }
            rep(l,m){
                if(i&(1<<(n+l))) continue;
                if(0<=j-c[l]) chmax(dp[i|(1<<(n+l))][j-c[l]],dp[i][j]-d[l]);
                chmax(dp[i|(1<<(n+l))][j],dp[i][j]);
            }
        }
    }
    ll ans=0;
    rep(i,1<<(n+m)){
        rep(j,w+1){
            chmax(ans,dp[i][j]);
        }
    }
    cout << ans << '\n';
}