#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int main(){
  int N, M, W;
  cin >> N >> M >> W;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<int> C(M);
  for (int i = 0; i < M; i++){
    cin >> C[i];
  }
  vector<int> D(M);
  for (int i = 0; i < M; i++){
    cin >> D[i];
  }
  vector<int> s(1 << (N + M), 0);
  for (int i = 0; i < (1 << (N + M)); i++){
    for (int j = 0; j < N; j++){
      if ((i >> j & 1) == 1){
        s[i] += A[j];
      }
    }
    for (int j = 0; j < M; j++){
      if ((i >> (N + j) & 1) == 1){
        s[i] -= C[j];
      }
    }
  }
  vector<long long> dp(1 << (N + M), -INF);
  dp[0] = 0;
  for (int i = 0; i < (1 << (N + M)); i++){
    if (0 <= s[i] && s[i] <= W){
      for (int j = 0; j < N + M; j++){
        if ((i >> j & 1) == 0){
          int i2 = i | (1 << j);
          if (0 <= s[i2] && s[i2] <= W){
            if (j < N){
              dp[i2] = max(dp[i2], dp[i] + B[j]);
            } else {
              dp[i2] = max(dp[i2], dp[i] - D[j - N]);
            }
          }
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < (1 << (N + M)); i++){
    ans = max(ans, dp[i]);
  }
  cout << ans << endl;
}