#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
#include <tuple>
using namespace std;
using ll = long long;

int N, M;
ll W;

int main() {

    cin >> N >> M >> W;
    vector<ll> A(N),S(N+1,0),B(M),C(M);
    for(int i = 0; i < N; ++i) cin >> A[i];
    sort(A.begin(),A.end(),greater<ll>());

    for(int i = 0; i < N; ++i) S[i+1] = S[i]+A[i];

    for(int i = 0; i < M; ++i) cin >> B[i];
    for(int i = 0; i < M; ++i) cin >> C[i];

    ll mx = 0;
    for(int i = 0; i < 1<<M; ++i) {
        ll sw = 0, sv = 0;
        for(int j = 0; j < M; ++j) {
            if((i>>j&1) == 0) continue;
            sw += B[j];
            sv += C[j];
        }

        if(sw <= W) {
            if(W-sw > N) mx = max(mx, sv+S[N]);
            else mx = max(mx, sv+S[W-sw]);
        }
    }

    cout << mx << endl;

}