#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}
int main() {
    fast_io();
    int n, m;
    long long w;
    cin >> n >> m >> w;
    vector<long long> a(n), b(m), c(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> c[i];
    }
    sort(a.rbegin(), a.rend());
    vector<long long> cum(n + 1);
    for (int i = 0; i < n; i++) {
        cum[i + 1] = cum[i] + a[i];
    }
    long long ans = 0;
    for (int st = 0; st < (1 << m); st++) {
        long long sum = 0, weight = 0;
        for (int i = 0; i < m; i++) {
            if (st & (1 << i)) {
                sum += c[i];
                weight += b[i];
            }
        }
        if (weight > w) {
            continue;
        }
        if (weight + n <= w) {
            ans = max(ans, sum + cum[n]);
        } else {
            ans = max(ans, sum + cum[w - weight]);
        }
    }
    cout << ans << endl;
}