#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using pint = pair<int, int>;
using vp = vector<pint>;

int main() {
	int N, M, W;
	cin >> N >> M >> W;
	vi A(N), B(N), C(M), D(M);
	vin(A);
	vin(B);
	vin(C);
	vin(D);

	int a=0, b=0, c=0, x, y, z;
	vp p;
	rep(i, N) p.pb({A[i], B[i]});
	rep(i, M) p.pb({-C[i], -D[i]});
	vi v(N);
	rep(i, N) v[i] = i;
	do {
		vi w(M);
		rep(i, M) w[i] = i;
		do {
			a = 0, b = 0, x = 0;
			rep(i, N) {
				while (a+A[v[i]] > W) {
					if (x == M) break;
					a -= C[w[x]];
					b -= D[w[x]];
					chmax(a, 0);
					x++;
				}
				if (a+A[v[i]] <= W) {
					a += A[v[i]];
					b += B[v[i]];
				} else {
					break;
				}
				chmax(c, b);
			}
		} while(next_permutation(all(w)));
	} while(next_permutation(all(v)));
	std::cout << c << '\n';
}