#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)
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; ll w; cin >> n >> m >> w;
  vector<ll> a(n + 1, 0); FOR(i, 1, n + 1) cin >> a[i];
  sort(next(a.begin()), a.end(), greater<ll>());
  REP(i, n) a[i + 1] += a[i];
  vector<int> b(m), c(m);
  for (int& b_i : b) cin >> b_i;
  for (int& c_i : c) cin >> c_i;
  ll ans = 0;
  REP(bit, 1 << m) {
    ll v = 0, rem = w;
    REP(i, m) {
      if (bit >> i & 1) {
        v += c[i];
        rem -= b[i];
      }
    }
    if (rem >= 0) chmax(ans, v + a[min<ll>(n, rem)]);
  }
  cout << ans << '\n';
  return 0;
}