#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

ll op(ll a,ll b){
  return max(a,b);
}
ll e(){
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m,k;cin>>n>>m>>k;
  vl C(n),A(m);
  rep(i,0,n)cin>>C[i];
  rep(i,0,m)cin>>A[i];
  segtree<ll,op,e> seg(m+1);
  ll ans=infl,to=0;
  rep(i,0,n){
    if(i>=k){
      ans=min(ans,to-seg.all_prod());
      seg.set(C[i-k],seg.get(C[i-k])-A[C[i-k]-1]);
    }
      to+=A[C[i]-1];
      seg.set(C[i],seg.get(C[i])+A[C[i]-1]);
  }
  cout<<ans<<el;
}