// github.com/Johniel/contests // yukicoder/2364/main.cpp #include #define each(i, c) for (auto& i : c) #define unless(cond) if (!(cond)) // #define endl "\n" using namespace std; template ostream& operator << (ostream& os, pair p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream& operator >> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator << (ostream& os, vector v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; } template istream& operator >> (istream& is, vector& v) { for (auto& i: v) is >> i; return is; } template ostream& operator << (ostream& os, set s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; } template ostream& operator << (ostream& os, map m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; } template istream& operator >> (istream& is, array& a) { for (auto& i: a) is >> i; return is; } template ostream& operator << (ostream& os, array& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; } template inline T setmax(T& a, T b) { return a = std::max(a, b); } template inline T setmin(T& a, T b) { return a = std::min(a, b); } __attribute__((constructor)) static void ___initio(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; } using lli = long long int; using ull = unsigned long long; using str = string; template using vec = vector; constexpr array di({0, 1, -1, 0, 1, -1, 1, -1}); constexpr array dj({1, 0, 0, -1, 1, -1, -1, 1}); constexpr lli mod = 1e9 + 7; // constexpr lli mod = 998244353; int main(int argc, char *argv[]) { int n, m, w; while (cin >> n >> m >> w) { vec a(n), b(n), c(m), d(m); cin >> a >> b >> c >> d; const int N = 7 + 3; const int M = 7 + 3; const int W = 500 + 3; static lli dp[N][M][W]; fill(&dp[0][0][0], &dp[N - 1][M - 1][W - 1] + 1, -(1LL << 60)); dp[0][0][0] = 0; for (int i = 0; i <= n; ++i) { for (int j = 0; j <= m; ++j) { for (int k = 0; k < W; ++k) { if (i < n && k + a[i] <= w) { setmax(dp[i + 1][j][k + a[i]], dp[i][j][k] + b[i]); } if (j < m && 0 <= k - c[j]) { setmax(dp[i][j + 1][k - c[j]], dp[i][j][k] - d[j]); } setmax(dp[i][j + 1][k], dp[i][j][k]); setmax(dp[i + 1][j][k], dp[i][j][k]); } } } cout << *max_element(&dp[0][0][0], &dp[N - 1][M - 1][W - 1] + 1) << endl; } return 0; }