#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}
ll op(ll a, ll b){
    return min(a, b);
}
ll e(){return 4e18;}

int main(){
    int n, m; ll k; cin >> n >> m >> k;
    vi c(n); rep(i, n){
        cin >> c[i];
        c[i]--;
    }
    vll a(m); rep(i, m){
        cin >> a[i];
    }
    vll s(m); rep(i, m)s[i] = a[i]*k;
    segtree<ll, op, e> seg(s);
    rep(i, k){
        seg.set(c[i], seg.get(c[i])-a[c[i]]);
    }
    ll ans = seg.all_prod();
    for(int i = 0; i+k < n; i++){
        seg.set(c[i], seg.get(c[i]) + a[c[i]]);
        seg.set(c[i+k], seg.get(c[i+k]) - a[c[i+k]]);
        ans = min(ans, seg.all_prod());
    }


    cout << ans << endl;
    return 0;
}