#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m, k; cin >> n >> m >> k;
  vector<int> c(n), a(m);
  for (int& c_i : c) cin >> c_i, --c_i;
  for (int& a_i : a) cin >> a_i;
  vector<int> egg(m, k);
  REP(i, k - 1) --egg[c[i]];
  set<pair<ll, int>> st;
  REP(i, m) st.emplace(ll{egg[i]} * a[i], i);
  ll ans = LINF;
  FOR(i, k - 1, n) {
    st.erase(st.find({ll{egg[c[i]]} * a[c[i]], c[i]}));
    --egg[c[i]];
    st.emplace(ll{egg[c[i]]} * a[c[i]], c[i]);
    chmin(ans, st.begin()->first);
    st.erase(st.find({ll{egg[c[i - k + 1]]} * a[c[i - k + 1]], c[i - k + 1]}));
    ++egg[c[i - k + 1]];
    st.emplace(ll{egg[c[i - k + 1]]} * a[c[i - k + 1]], c[i - k + 1]);
  }
  cout << ans << '\n';
  return 0;
}