#include <algorithm>
#include <bit>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>
#include <string>

using namespace::std;

template <typename T>
void print(const T& v) {
 for (const auto& x : v) cout << x << " ";
 cout << endl;
}

int main() {
  ios::sync_with_stdio(false);
  int n, m, w;
  cin >> n >> m >> w;
  vector<int> dw(n + m);
  for (int i = 0; i < n; ++i) cin >> dw[i];
  vector<int> dv(n + m);
  for (int i = 0; i < n; ++i) cin >> dv[i];
  for (int i = 0; i < m; ++i) { cin >> dw[n + i]; dw[n + i] = -dw[n + i]; }
  for (int i = 0; i < m; ++i) { cin >> dv[n + i]; dv[n + i] = -dv[n + i]; }
  
  vector<vector<long long>> d(1 << (n + m), vector<long long>(w + 1));
  
  long long r = 0;
  for (int s = 1; s < 1 << (n + m); ++s)
    for (int i = 0; i < n + m; ++i)
      if (s & (1 << i))
        for (int pw = 0; pw <= w; ++pw) {
          int nw = pw + dw[i];
          if (0 <= nw && nw <= w) {
            d[s][nw] = max(d[s][nw], d[s ^ (1 << i)][pw] + dv[i]);   
            r = max(r, d[s][nw]);
          }
        }
  
  cout << r << endl;

  return 0;
}