#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> c(n); 
    rep(i, n){
        cin >> c[i];
        c[i]--;
    }
    vector<ll> a(m); rep(i, m) cin >> a[i];

    vector<ll> cnt(m, 0);
    for(ll i=0; i<k; i++) cnt[c[i]]++;
    ll ans = LINF;
    for(ll j=0; j<m; j++) ans = min(ans, (k-cnt[j])*a[j]);

    for(ll i=k; i<n; i++){
        cnt[c[i-k]]--;
        cnt[c[i]]++;
        ans = min(ans, (k-cnt[c[i]])*a[c[i]]);
    }

    cout << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}