#include <bits/stdc++.h>
using namespace std;

template <typename T> bool is_kth_bit_set(T n, int k) { return n >> k & 1; }

#define rep(i, n) for (int i = 0; i < n; i++)

template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  int n = a.size();
  rep(i, n) { is >> a[i]; }
  return is;
}

template <typename T> void chmax(T &a, T b) {
  if (b > a)
    a = b;
}

template <typename F, typename T, typename U = T>
vector<U> products(F &f, vector<T> &a) {
  int n = a.size();
  vector<U> b(1 << n);
  rep(i, n) rep(s, 1 << i) { b[s | 1 << i] = f(b[s], a[i]); }
  return b;
}

auto main() -> int {
  int n, m, w;
  cin >> n >> m >> w;
  vector<int> a(n), b(n), c(m), d(m);
  cin >> a >> b >> c >> d;

  int l = n + m;
  int l2 = 1 << l;

  vector<long> dw(l), dv(l);
  rep(i, l) {
    dw[i] = i < n ? a[i] : -c[i - n];
    dv[i] = i < n ? b[i] : -d[i - n];
  }
  auto op = [](long x, int y) { return x + y; };
  vector<long> v = products(op, dv);
  vector<long> wt = products(op, dw);
  vector<bool> ok(l2);
  ok[0] = true;
  long mx = 0;
  rep(s, l2) {
    if (!ok[s])
      continue;
    chmax(mx, v[s]);
    rep(i, l) {
      if (s >> i & 1)
        continue;
      int u = s | 1 << i;
      if (0 <= wt[u] && wt[u] <= w)
        ok[u] = true;
    }
  }
  cout << mx << endl;
}