#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    long N, M, W;
    cin >> N >> M >> W;
    vector<long> A(N), B(M), C(M), S(N+1, 0);
    for (long& x : A) cin >> x;
    for (long& x : B) cin >> x;
    for (long& x : C) cin >> x;
    sort(A.rbegin(), A.rend());
    for (int i = 0; i < N; i++) S[i+1] = S[i]+A[i];

    long ans = 0;
    for (int bit = 0; bit < (1<<N); bit++){
        long bb = 0, cc = 0;
        for (int i = 0; i < N; i++){
            if (bit>>i&1){
                bb += B[i], cc += C[i];
            }
        }
        if (bb > W) continue;
        cc += S[min(N, W-bb)];
        ans = max(ans, cc);
    }

    cout << ans << endl;
}