#include<bits/stdc++.h> 
using namespace std;
using ll=long long;

void solve(){
	ll N,M,K;
	cin>>N>>M>>K;
	ll S=0;
	vector<ll> C(M,0);
	multiset<ll> MS;
	
	vector<ll> P(N),Q(M);
	for(ll i=0;i<N;i++){
		cin>>P[i];
		P[i]--;
	}
	for(ll i=0;i<M;i++){
		cin>>Q[i];
	}
	for(int i=0;i<M;i++){
		MS.insert(Q[i]*K);
		C[i]=Q[i]*K;
	}
	for(ll i=0;i<K;i++){
		MS.erase(MS.find(C[P[i]]));
		C[P[i]]-=Q[P[i]];
		MS.insert(C[P[i]]);
	}
	ll an=*(MS.begin());
	for(int i=0;i<N-K;i++){
		MS.erase(MS.find(C[P[i]]));
		C[P[i]]+=Q[P[i]];
		MS.insert(C[P[i]]);

		MS.erase(MS.find(C[P[i+K]]));
		C[P[i+K]]-=Q[P[i+K]];
		MS.insert(C[P[i+K]]);
		

		an=min(an,*(MS.begin()));
	}
	cout<<an<<endl;
}

int main(){
	
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int T=1;
	// cin>>T;
	while(T--)solve();
}