#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

int main() {
    int N, M, W;
    cin >> N >> M >> W;

    vector<int> A(N), B(N), C(M), D(M);
    for (int i = 0; i < N; ++i) cin >> A[i];
    for (int i = 0; i < N; ++i) cin >> B[i];
    for (int i = 0; i < M; ++i) cin >> C[i];
    for (int i = 0; i < M; ++i) cin >> D[i];

    int ans = 0;

    vector<int> perm1(N);
    iota(perm1.begin(), perm1.end(), 0);

    vector<int> perm2(M);
    iota(perm2.begin(), perm2.end(), 0);

    do {
        do {
            int idx1 = 0, idx2 = 0;
            int w = 0, v = 0;

            while (idx1 < N) {
                if (w + A[perm1[idx1]] <= W) {
                    w += A[perm1[idx1]];
                    v += B[perm1[idx1]];
                    ans = max(ans, v);
                    ++idx1;
                } else {
                    while (idx2 < M && W < w + A[perm1[idx1]]) {
                        w -= C[perm2[idx2]];
                        v -= D[perm2[idx2]];
                        ++idx2;
                    }
                    if (W < w + A[perm1[idx1]] || w < 0) {
                        break;
                    }
                }
            }
        } while (next_permutation(perm2.begin(), perm2.end()));
    } while (next_permutation(perm1.begin(), perm1.end()));

    cout << ans << endl;

    return 0;
}