#include <bits/stdc++.h>
#include <atcoder/lazysegtree>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
ll op(ll a,ll b){
    return min(a,b);
}
ll e(){
    return INF;
}
ll mapping(ll f,ll x){
    return f+x;
}
ll composition(ll f,ll g){
    return f+g;
}
ll id(){
    return 0;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n,m,k;
    cin >> n >> m >> k;
    vector<vector<ll>> v(m);
    vector<ll> c(n);
    rep(i,n){
        cin >> c[i];
        c[i]--;
    }
    vector<ll> a(m);
    rep(i,m) cin >> a[i];
    atcoder::lazy_segtree<ll,op,e,ll,mapping,composition,id> seg(m);
    rep(i,m) seg.set(i,0);
    rep(i,k){
        seg.apply(0,c[i],a[c[i]]);
        seg.apply(c[i]+1,m,a[c[i]]);
    }
    ll ans=seg.all_prod();
    for(ll i=k;i<n;i++){
        seg.apply(0,c[i-k],-a[c[i-k]]);
        seg.apply(c[i-k]+1,m,-a[c[i-k]]);
        seg.apply(0,c[i],a[c[i]]);
        seg.apply(c[i]+1,m,a[c[i]]);
        chmin(ans,seg.all_prod());
    }
    cout << ans << '\n';
}