#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m;
	long long w;
	cin >> n >> m >> w;
	vector<int>a(n), b(m), c(m);
	rep(i, n)cin >> a[i];
	rep(i, m)cin >> b[i];
	rep(i, m)cin >> c[i];
	sort(allR(a));
	vector<long long>sa(n + 1);
	rep(i, n)sa[i + 1] = sa[i] + a[i];
	long long ans = 0;
	rep(i, 1 << m) {
		long long tmpW = 0;
		long long tmpV = 0;
		rep(j, m) {
			if (1 & (i >> j)) {
				tmpW += b[j];
				tmpV += c[j];
			}
		}
		if (tmpW > w)continue;
		long long x = w - tmpW;
		x = min(x, (long long)n);
		tmpV += sa[x];
		chmax(ans, tmpV);
	}
	cout << ans << endl;
	return 0;
}