// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n, m, w;
    cin >> n >> m >> w;
    vi a(n), b(n), c(m), d(m);
    FOR(n) cin >> a[i];
    FOR(n) cin >> b[i];
    FOR(m) cin >> c[i];
    FOR(m) cin >> d[i];

    vvvi dp(1<<n, vvi(1<<m, vi(w+1, -INF)));
    dp[0][0][0] = 0;

    rep(i, 1<<n) {
        rep(j, 1<<m) {
            rep(k, n) if(!(i>>k&1)) {
                rep(l, w+1) if(l+a[k] <= w) {
                    chmax(dp[i|(1<<k)][j][l+a[k]], dp[i][j][l] + b[k]);
                }
            }
            rep(k, m) if(!(j>>k&1)) {
                rep(l, w+1) if(l-c[k] >= 0) {
                    chmax(dp[i][j|(1<<k)][l-c[k]], dp[i][j][l] - d[k]);
                }
            }
        }
    }

    int ans = 0;
    rep(i, 1<<n) rep(j, 1<<m) rep(k, w+1) chmax(ans, dp[i][j][k]);
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}