#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    int N, M, W, S, ans=0;
    cin >> N >> M >> W;
    S = 1<<(N+M);
    vector<int> A(N+M), B(N+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 >> A[N+i];
        A[N+i] *= -1;
    }
    for (int i=0; i<M; i++){
        cin >> B[N+i];
        B[N+i] *= -1;
    }

    N += M;

    vector<vector<int>> dp(S, vector<int>(W+1, -1e9));
    dp[0][0] = 0;

    for (int i=0; i<S; i++){
        for (int j=0; j<N; j++){
            if (i & 1<<j) continue;
            for (int k=0; k<=W; k++){
                if (k+A[j] <= W && k+A[j] >= 0) dp[i|(1<<j)][k+A[j]] = max(dp[i|(1<<j)][k+A[j]], dp[i][k] + B[j]);
            }
        }
    }

    for (int i=0; i<S; i++){
        for (int j=0; j<=W; j++) ans = max(ans, dp[i][j]);
    }

    cout << ans << endl;

    return 0;
}