#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = n; i > 0; --i)
#define bitrep(i, n) for (ll i = 0; i < (1 << n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define yesNo(b) ((b) ? "Yes" : "No")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const double pi = 3.141592653589793;
ll smallMOD = 998244353;
ll bigMOD = 1000000007;

int main()
{
    ll n, m, k;
    cin >> n >> m >> k;
    vector<ll> C(n), A(m);
    rep(i, n) cin >> C[i], C[i]--;
    rep(i, m) cin >> A[i];
    vector<ll> cost(m, 0);
    rep(i, m)
    {
        cost[i] = A[i] * k;
    }
    rep(i, k)
    {
        cost[C[i]] -= A[C[i]];
    }
    ll mn = *min_element(all(cost));
    rep(i, n - k)
    {
        cost[C[i]] += A[C[i]];
        cost[C[i + k]] -= A[C[i + k]];
        mn = min(mn, cost[C[i + k]]);
    }
    cout << mn << endl;
    return 0;
}