#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, m, w, ans = 0;
    cin >> n >> m >> w;
    vector<ll> a(n), b(m), c(m), s(n + 1);
    for(auto &&v : a) cin >> v;
    for(auto &&v : b) cin >> v;
    for(auto &&v : c) cin >> v;
    sort(a.rbegin(), a.rend());
    for(int i = 0; i < n; i++){
        s[i + 1] = s[i] + a[i];
    }
    for(int S = 0; S < (1 << m); S++){
        ll bs = 0, cs = 0;
        for(int i = 0; i < m; i++){
            if(S >> i & 1){
                bs += b[i];
                cs += c[i];
            }
        }
        if(bs > w) continue;
        ans = max(ans, s[min(n, w - bs)] + cs);
    }
    cout << ans << '\n';
}