#ifdef LOCAL
#include <local.hpp>
#else
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define postprocess(...) ((void)0)
#endif

using namespace std;
using ll = long long;
using ld = long double;

void solve([[maybe_unused]] int test) {
    ll N, M, W;
    cin >> N >> M >> W;

    vector<ll> A(N), B(M), C(M);
    for (auto&& x : A) {
        cin >> x;
    }
    for (auto&& x : B) {
        cin >> x;
    }
    for (auto&& x : C) {
        cin >> x;
    }
    sort(A.begin(), A.end(), greater<ll>());
    for (int i = 1; i < N; i++) {
        A[i] += A[i - 1];
    }

    ll ans = numeric_limits<ll>::lowest();

    for (int i = 0; i < (1 << M); i++) {
        ll value = 0;
        ll weight = 0;
        for (int j = 0; j < M; j++) {
            if (i & (1 << j)) {
                value += C[j];
                weight += B[j];
            }
        }

        if (weight > W) continue;

        ll rem = min(N, W - weight);
        if (rem) {
            value += A[rem - 1];
        }

        ans = max(ans, value);
    }

    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        solve(i);
    }

    postprocess();
}