import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int k = sc.nextInt();
        int[] colors = new int[n];
        for (int i = 0; i < n; i++) {
            colors[i] = sc.nextInt() - 1;
        }
        int[] values = new int[m];
        for (int i = 0; i < m; i++) {
            values[i] = sc.nextInt();
        }
        List<Egg> eggs = new ArrayList<>();
        TreeSet<Egg> inqueue = new TreeSet<>();
        for (int i = 0; i < m; i++) {
            eggs.add(new Egg(i, 0));
            inqueue.add(eggs.get(i));
        }
        long total = 0;
        for (int i = 0; i < k - 1; i++) {
            inqueue.remove(eggs.get(colors[i]));
            eggs.get(colors[i]).add(values[colors[i]]);
            inqueue.add(eggs.get(colors[i]));
            total += values[colors[i]];
        }
        long ans = Long.MAX_VALUE;
        for (int i = k - 1; i < n; i++) {
            inqueue.remove(eggs.get(colors[i]));
            eggs.get(colors[i]).add(values[colors[i]]);
            inqueue.add(eggs.get(colors[i]));
            total += values[colors[i]];
            ans = Math.min(ans, total - inqueue.last().value);
            inqueue.remove(eggs.get(colors[i - k + 1]));
            eggs.get(colors[i - k + 1]).add(-values[colors[i - k + 1]]);
            inqueue.add(eggs.get(colors[i - k + 1]));
            total += values[colors[i - k + 1]];
        }
        System.out.println(ans);
    }
    
    static class Egg implements Comparable<Egg> {
        int idx;
        long value;
        
        public Egg(int idx, long value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Egg another) {
            if (value == another.value) {
                return idx - another.idx;
            } else {
                return Long.compare(value, another.value);
            }
        }
        
        public int hashCode() {
            return idx;
        }
        
        public boolean equals(Object o) {
            return idx == o.hashCode();
        }
        
        public void add(long v) {
            value += v;
        }
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}