#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, K;
    cin >> N >> M >> K;

    vector<int> C(N);
    for (int &x : C) cin >> x;

    vector<long long> A(M + 1);
    for (int i = 1; i <= M; i++) cin >> A[i];

    vector<int> freq(M + 1, 0);


    for (int i = 0; i < K; i++)
        freq[C[i]]++;

    long long ans = LLONG_MAX;

    for (int L = 0; L + K <= N; L++) {


        for (int j = 1; j <= M; j++) {
            long long cost = (long long)(K - freq[j]) * A[j];
            ans = min(ans, cost);
        }


        if (L + K < N) {
            freq[C[L]]--;
            freq[C[L + K]]++;
        }
    }

    cout << ans << "\n";

    return 0;
}