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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n,m,w;cin >> n >> m >> w;
	vector<ll> a(n),b(m),c(m);
	rep(i,0,n)cin>>a[i];
	rep(i,0,m)cin>>b[i];
	rep(i,0,m)cin>>c[i];
	sort(a.begin(),a.end());
	reverse(a.begin(),a.end());
	vector<ll>rui(n+1);
	rep(i,0,n)rui[i+1]=rui[i]+a[i];
	
	ll ans = 0;
	rep(i,0,1<<m){
		ll now_val=0;
		ll now_wei=w;
		rep(j,0,m){
			if(i>>j&1){
				now_val+=c[j];
				now_wei-=b[j];
			}
		}
		if(now_wei<0) continue;
		ll targ = min(now_wei,n);
		chmax(ans,rui[targ]+now_val);
	}
	cout<<ans<<'\n';
}