#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
#include <tuple>
using namespace std;
using ll = long long;

int N, M, K;
int C[202020];
ll A[202020], S[202020];

int main() {

    cin >> N >> M >> K;
    for(int i = 1; i <= N; ++i) cin >> C[i];
    for(int i = 1; i <= M; ++i) cin >> A[i];
    
    multiset<pair<ll,int>> mst;
    for(int i = 1; i <= M; ++i) mst.insert({K*A[i],i});
    vector<ll> cost(M+1, 0);
    for(int i = 1; i <= M; ++i) cost[i] = K*A[i];

    for(int i = 1; i <= K-1; ++i) {
        mst.erase({cost[C[i]], C[i]});
        cost[C[i]] -= A[C[i]];
        mst.insert({cost[C[i]], C[i]});
    }

    ll ans = 1e18;
    for(int i = K; i <= N; ++i) {
        mst.erase({cost[C[i]], C[i]});
        cost[C[i]] -= A[C[i]];
        mst.insert({cost[C[i]], C[i]});

        auto itr = mst.begin();
        ll mn = (*itr).first;
        ans = min(ans, mn);

        mst.erase({cost[C[i-K+1]], C[i-K+1]});
        cost[C[i-K+1]] += A[C[i-K+1]];
        mst.insert({cost[C[i-K+1]], C[i-K+1]});

    }

    cout << ans << endl;

}