#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,M,W; cin >> N >> M >> W;
  vector<int> A(N);
  vector<ll> B(N);
  vector<int> C(M);
  vector<ll> D(M);
  rep(i,N) cin >> A[i];
  rep(i,N) cin >> B[i];
  rep(i,M) cin >> C[i];
  rep(i,M) cin >> D[i];

  vector dp(1<<(N+M),vector<ll>(W+1,-(1LL<<60)));
  dp[0][0] = 0;
  rep(i,1<<(N+M)){
    rep(j,N+M){
      if(((i>>j)&1)==0){
        rep(w,W+1){
          chmax(dp[i+(1<<j)][w],dp[i][w]);
          if(j<N){
            if(w+A[j]<=W){
              chmax(dp[i+(1<<j)][w+A[j]],dp[i][w]+B[j]);
            }
          }
          else{
            if(w-C[j-N]>=0){
              chmax(dp[i+(1<<j)][w-C[j-N]],dp[i][w]-D[j-N]);
            }
          }
        }
      }
    }
  }
  ll ans = 0;
  rep(w,W+1) chmax(ans,dp[(1<<(N+M))-1][w]);
  cout << ans << endl;
  return 0;
};