#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 endl "\n"
#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, w; cin >> n >> m >> w;
	vector<int>a(n), b(n), c(m), d(m);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	rep(i, m)cin >> c[i];
	rep(i, m)cin >> d[i];
	vector dp(1 << (n + m), vector<int>(w + 1, -INF));
	dp[0][0] = 0;
	rep(i, 1 << (n + m))rep(j, w + 1) {
		rep(k, n + m) {
			if (1 & (i >> k))continue;
			int ni = i + (1 << k);
			int nj = j;
			chmax(dp[ni][nj], dp[i][j]);
			if (k < n) {
				nj += a[k];
				if (nj <= w)chmax(dp[ni][nj], dp[i][j] + b[k]);
			}
			else {
				nj -= c[k - n];
				if (nj >= 0)chmax(dp[ni][nj], dp[i][j] - d[k - n]);
			}
		}
	}
	int ans = 0;
	rep(i, w + 1)chmax(ans, dp[(1 << (n + m)) - 1][i]);
	cout << ans << endl;
	return 0;
}