#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

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);
    cin >> A >> B >> C >> D;

    vector dp(1 << (N + M), vector<int>(W + 1, -INF));
    dp[0][0] = 0;
    int ans = 0;
    for (int mask = 0; mask < 1 << (N + M); mask++) {
        for (int i = 0; i <= W; i++) {
            int& val = dp[mask][i];
            if (val == -INF) continue;
            chmax(ans, val);
            for (int j = 0; j < N + M; j++) {
                if (mask >> j & 1) continue;
                if (j < N) {
                    if (i + A[j] <= W) {
                        chmax(dp[mask | 1 << j][i + A[j]], val + B[j]);
                    }
                } else {
                    if (i - C[j - N] >= 0) {
                        chmax(dp[mask | 1 << j][i - C[j - N]], val - D[j - N]);
                    }
                }
            }
        }
    }

    cout << ans << '\n';
    return 0;
}