#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    ll N, M, W;
    cin >> N >> M >> W;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<ll> B(M);
    for (ll i = 0; i < M; i++) {
        cin >> B[i];
    }
    vector<ll> C(M);
    for (ll i = 0; i < M; i++) {
        cin >> C[i];
    }
    sort(A.begin(), A.end());
    reverse(A.begin(), A.end());
    vector<ll> sums(N + 1, 0LL);
    for (ll i = 0; i < N; i++) {
        sums[i + 1] = sums[i] + A[i];
    }
    ll ans = 0;
    for (ll i = 0; i < (1 << M); i++) {
        ll weigh = 0;
        ll value = 0;
        for (ll j = 0; j < M; j++) {
            if ((i >> j) & 1) {
                weigh += B[j];
                value += C[j];
            }
        }
        if (weigh <= W) {
            value += sums[min(W - weigh, N)];
        }
        if (weigh <= W) {
            ans = max(ans, value);
        }
    }
    cout << ans << endl;
}