#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::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  int n = a.size();
  rep(i, n) { os << a[i] << " \n"[i == n - 1]; }
  return os;
}

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 T> void chmin(T &a, T b) {
  if (b < a)
    a = 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> v(l2), wt(l2);
  rep(i, l) {
    long dw = i < n ? a[i] : -c[i - n];
    long dv = i < n ? b[i] : -d[i - n];
    rep(s, 1 << i) {
      int u = s | 1 << i;
      v[u] = v[s] + dv;
      wt[u] = wt[s] + 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;
}