#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m, w; cin >> n >> m >> w;
  vector<int> a(n), b(n), c(m), 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<int> dp(1 << (n + m), false);
  dp[0] = true;
  REP(bit, 1 << (n + m)) {
    if (!dp[bit]) continue;
    int weight = 0;
    REP(i, n) {
      if (bit >> i & 1) weight += a[i];
    }
    REP(i, m) {
      if (bit >> (i + n) & 1) weight -= c[i];
    }
    REP(i, n) {
      if (!(bit >> i & 1) && weight + a[i] <= w) dp[bit | (1 << i)] = true;
    }
    REP(i, m) {
      if (!(bit >> (i + n) & 1) && weight >= c[i]) dp[bit | (1 << (i + n))] = true;
    }
  }
  int ans = -INF;
  REP(bit, 1 << (n + m)) {
    if (dp[bit]) {
      int value = 0;
      REP(i, n) {
        if (bit >> i & 1) value += b[i];
      }
      REP(i, m) {
        if (bit >> (i + n) & 1) value -= d[i];
      }
      chmax(ans, value);
    }
  }
  cout << ans << '\n';
  return 0;
}