#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

ll op(ll a, ll b){
    return min(a,b);
}

ll e(){
    return 5e18;
}

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<ll> a(m), c(n);
    rep(i,n) cin >> c[i];
    rep(i,m) cin >> a[i];
    vector<ll> cnt(m);
    rep(i,n) c[i]--;
    vector<ll> sum(n+1);
    rep(i,n) sum[i+1] = sum[i] + a[i];
    ll ans = 5e18;
    ll now = sum[k];
    segtree<ll, op, e> seg(m);
    rep(i,m){
        seg.set(i,a[i]*k);
    }
    rep(i,k){
        seg.set(c[i], seg.get(c[i])-a[c[i]]);
    }
    ans = min(ans, seg.all_prod());
    for(int i=k;i<n;i++){
        int j = i-k;
        seg.set(c[j], seg.get(c[j])+a[c[j]]);
        seg.set(c[i], seg.get(c[i])-a[c[i]]);
        ans = min(ans, seg.all_prod());
    }
    cout << ans << endl;
    return 0;
}