#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;

const int SZ = 4e3 + 4;

int n, m, c;
vector<int> a[SZ];
int s[SZ];
int b[SZ];
int sum = 0;

bool comp(int x, int y) {
    return x > y;
}

int main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> m >> c;
    vector<int> t(n);
    for (int i = 0; i < n; ++i) {
        cin >> t[i];
        --t[i];
    }
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        a[t[i]].push_back(x);
        s[t[i]] += x;
        sum += x;
    }
    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }

     for (int i = 0; i < m; ++i) {
        sort(a[i].begin(), a[i].end(), comp);
        for (int j = 0; j < a[i].size(); ++j) {
            if (j) a[i][j] += a[i][j - 1];
            if (j + 1 >= b[i]) {
                a[i][j] = s[i];
            }
        }
    }

    vector<int> dp(c + 1, -1);
    dp[0] = 0;
    for (int i = 0; i < m; ++i) {
        for (int j = c; j >= 1; --j) {
            for (int k = 0; k < a[i].size(); ++k) {
                if (k + 1 <= j && dp[j - k - 1] != -1) {
                    dp[j] = max(dp[j], dp[j - k - 1] + a[i][k]);
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= c; ++i) {
        ans = max(ans, dp[i]);
    }

    cout << sum - ans << "\n";

    return 0;
}