#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint998244353;

int main(){
	int n, m;
	long long w;
	cin >> n >> m >> w;
	vector<long long> a(n);
	cin >> a;
	vector<long long> b(m);
	vector<long long> c(m);
	cin >> b >> c;
	vector<long long> s(n + 1);
	sort(a.rbegin(), a.rend());
	rep(i, n) s[i + 1] = s[i] + a[i];
	long long ans = 0;
	rep(bit, 1 << m){
		long long tot_weight = 0;
		long long tot_value = 0;
		rep(i, m){
			if((bit >> i) & 1){
				tot_weight += b[i];
				tot_value += c[i];
			}
		}
		if(tot_weight > w) continue;
		if(tot_weight + n <= w) tot_value += s[n];
		else tot_value += s[w - tot_weight];
		chmax(ans, tot_value);
	}
	cout << ans << "\n";
	return 0;
}