#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
using namespace std;

typedef long long ll;

int main(){
  ll n,m,k;
  ll color[200005];
  ll cost[200005];
  ll cnt[200005]={0};

  cin>>n>>m>>k;
  for(int i=1;i<=n;i++){
    cin>>color[i];
  }
  for(int i=1;i<=m;i++){
    cin>>cost[i];
  }

  ll minimum=LLONG_MAX;
  for(int i=1;i<=k;i++){
    cnt[color[i]]++;
  }
  for(int i=1;i<=m;i++){
    minimum=min(minimum,cost[i]*(k-cnt[i]));
  }
  for(int i=1;i<=n-k;i++){
    int left=color[i];
    int right=color[i+k];
    cnt[left]--;
    cnt[right]++;
    minimum=min(minimum,cost[left]*(k-cnt[left]));
    minimum=min(minimum,cost[right]*(k-cnt[right]));
  }
  cout<<minimum<<endl;
  return(0);
}