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

int N, M;
ll W;
ll A[1010101];
ll B[20], C[20];
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> M >> W;
    for(int i = 1;i <= N;i++)cin >> A[i];
    for(int i = 0;i < M;i++)cin >> B[i];
    for(int i = 0;i < M;i++)cin >> C[i];
    sort(A, A + N + 1);
    reverse(A + 1, A + N + 1);
    for(int i = 0;i < N;i++){
        A[i + 1] += A[i];
    }
    ll ans = 0;
    for(int i = 0;i < (1 << M);i++){
        ll v = 0, w = 0;
        for(int j = 0;j < M;j++){
            if(i >> j & 1)continue;
            w += B[j];
            v += C[j];
        }
        if(w > W)continue;
        ans = max(ans, v + A[min((ll)N, W - w)]);
    }
    cout << ans << endl;
    return 0;
}