#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
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; }
struct settings{settings(){ios_base::sync_with_stdio(0); cin.tie(0); cout<<fixed<<setprecision(15);};}settingss;
const double PI = acos(-1);
const int INF = 1001001001;
const ll LINF = 1001001001001001001LL;

ll A[10], B[10], C[10], D[10];
vvll dp((1<<15), vll(510, -LINF));

int main() {
  ll N, M, W; cin >> N >> M >> W;
  rep(i, N) cin >> A[i];
  rep(i, N) cin >> B[i];
  rep(i, M) cin >> C[i];
  rep(i, M) cin >> D[i];
  ll ans = 0;
  dp[0][0] = 0;
  rep(bit, (1<<(N+M))) {
    rep(w, W+1) {
      rep(i, N) {
        if(bit&(1<<(i+M))) continue;
        if(w + A[i] <= W) {
          chmax(dp[bit|(1<<(i+M))][w+A[i]], dp[bit][w] + B[i]);
          chmax(ans, dp[bit|(1<<(i+M))][w+A[i]]);
        }
      }
      rep(i, M) {
        if(bit&(1<<(i))) continue;
        if(w - C[i] >= 0) {
          chmax(dp[bit|(1<<(i))][w-C[i]], dp[bit][w] - D[i]);
          chmax(ans, dp[bit|(1<<(i))][w-C[i]]);
        }
      }
    }
  }
  cout << ans << endl;
}