#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, w;
    cin >> n >> m >> w;
    vector<ll> a(n), b(n), c(m), d(m);
    cin >> a >> b >> c >> d;
    const ll INF = (1ll << 60);
    ll ans = 0;
    vector<vector<ll>> dp(1 << (n + m), vector<ll>(w + 1, -INF));
    dp[0][0] = 0;
    for(int i = 0; i < (1 << (n + m)); i++){
        for(int j = 0; j <= w; j++){
            if(dp[i][j] == -INF) continue;
            for(int k = 0; k < (n + m); k++){
                if(i >> k & 1) continue;
                int nw = j + (k < n ? a.at(k) : -c.at(k - n));
                if(nw < 0 || nw > w) continue;
                ll nv = dp[i][j] + (k < n ? b[k] : -d[k - n]);
                dp[i | (1 << k)][nw] = max(dp[i | (1 << k)][nw], nv);
                ans = max(ans, nv);
            }
        }
    }
    cout << ans << '\n';
}