#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    ll w;
    cin >> n >> m >> w;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    sort(a.rbegin(),a.rend());
    vector<ll> sum(n+1);
    rep(i,n) sum[i+1] = sum[i] + a[i];
    vector<ll> b(m), c(m);
    rep(i,m) cin >> b[i];
    rep(i,m) cin >> c[i];
    ll ans = 0;
    rep(i,1<<m){
        ll now = 0;
        ll tmp = 0;
        rep(j,m) {
            if(i>>j&1) {
                now += b[j];
                tmp += c[j];
            }
        }
        if(now<=w) {
            tmp += sum[min(w-now, (ll)n)];
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
    return 0;
}