using System;
using System.Linq;
using System.Collections.Generic;
//using System.Numerics;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using Number = System.Int64;
namespace Program {
    public class Solver {
        public void Solve() {
            var m = ri;
            var n = ri;
            var k = ri;
            var w = Enumerate(n, x => ri);
            var a = Enumerate(k, x => ri - 1);
            var G = new MCF.MinCostFlow(k + 5);
            var src = k + 3;
            var sink = src + 1;
            var s = new HashSet<int>();
            var sum = 0;
            var prev = Enumerate(n, x => -1);
            G.AddDirectedEdge(src, 0, 1000000, 0);
            G.AddDirectedEdge(k, sink, 1000000, 0);
            for (int i = 0; i < k; i++) {
                var id = a[i];
                sum += w[id];
                if (i + 1 < k) G.AddDirectedEdge(i, i + 1, 10000, 0);
                if (prev[id] != -1) {
                    if (prev[id] != i - 1)
                        G.AddDirectedEdge(prev[id] + 1, i, 1, -w[id]);
                    else sum -= w[id];
                }
                prev[id] = i;
            }
            s.Clear();
            for (int i = k - 1; i >= 0; i--) {
                var id = a[i];
                if (s.Add(id) && s.Count <= m) G.AddDirectedEdge(i + 1, sink, 1, 0);
            }
            /*
            for (int i = 0; i < G.G.Length; i++)
                foreach (var e in G.G[i])
                    if (e.Cap != 0) Console.WriteLine($"{i} {e.To}");
            */
            var ans = G.Execute(src, sink, m - 1);
            Debug.WriteLine(ans);
            Console.WriteLine(sum + ans.Value);
        }

        const long INF = 1L << 60;
        //int[] dx = { -1, 0, 1, 0 };
        //int[] dy = { 0, 1, 0, -1 };

        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }

    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }

    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0) {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion
namespace MCF {
    using C = System.Int32;
    using V = System.Int32;
    #region MinCostFlow
    public class MinCostFlow {
        bool hasng;
        public readonly List<Edge>[] G;
        public MinCostFlow(int V) {
            G = new List<Edge>[V];
            for (int i = 0; i < V; i++)
                G[i] = new List<Edge>();

        }
        public void AddDirectedEdge(int from, int to, C cap, V cost) {
            addEdge(from, to, cap, 0, cost);
        }

        public KeyValuePair<C, V> Execute(int src, int sink, C f = C.MaxValue, V inf = V.MaxValue / 2) {
            var n = G.Length;
            var dist = new V[n];
            var prev = new int[n];
            var prevEdge = new Edge[n];
            var potential = new V[n];


            C flow = 0;
            V cost = 0;
            var first = hasng;
            while (f > 0) {
                for (int i = 0; i < G.Length; i++)
                    dist[i] = inf;

                //shortest path
                if (first)//spfa
                {
                    var q = new Queue<int>();
                    q.Enqueue(src); dist[src] = 0;
                    var inQ = new bool[n];
                    while (q.Count > 0) {
                        var p = q.Dequeue();
                        inQ[p] = false;
                        foreach (var e in G[p]) {
                            var t = e.To;
                            var d = dist[p] + e.Cost;
                            if (e.Cap > 0 && d < dist[t]) {
                                if (!inQ[t]) {
                                    inQ[t] = true;
                                    q.Enqueue(t);
                                }
                                dist[t] = d; prev[t] = p; prevEdge[t] = e;
                            }
                        }
                    }
                    first = false;
                }
                else//dijkstra
                {
                    var vis = new bool[n];
                    var pq = new PriorityQueue<KeyValuePair<int, V>>((l, r) => l.Value.CompareTo(r.Value));
                    pq.Enqueue(new KeyValuePair<int, V>(src, 0));
                    dist[src] = 0;
                    while (pq.Count > 0) {
                        var p = pq.Dequeue().Key;
                        if (vis[p]) continue;
                        Debug.WriteLine(p);
                        vis[p] = true;
                        foreach (var e in G[p]) {
                            if (e.Cap <= 0) continue;
                            var t = e.To;
                            if (vis[t]) continue;
                            var d = dist[p] + e.Cost + potential[p] - potential[t];
                            if (dist[t] > d) {
                                dist[t] = d; prev[t] = p; prevEdge[t] = e;
                                pq.Enqueue(new KeyValuePair<int, V>(t, d));
                            }
                        }
                    }


                }


                //update
                {
                    if (dist[sink] == inf) break;
                    for (int i = 0; i < n; i++)
                        potential[i] = Math.Min(inf, potential[i] + dist[i]);
                    C df = f;
                    V d = 0;
                    for (var v = sink; v != src; v = prev[v]) {
                        var e = prevEdge[v];
                        df = Math.Min(df, e.Cap); d += e.Cost;
                    }
                    f -= df; cost += df * d; flow += df;
                    for (var v = sink; v != src; v = prev[v]) {
                        var e = prevEdge[v];
                        e.Cap -= df; e.Rev.Cap += df;
                    }
                }

            }
            return new KeyValuePair<C, V>(flow, cost);
        }
        void addEdge(int f, int t, C c1, C c2, V e) {
            if (e < 0) hasng = true;
            var a = new Edge(t, c1, e);
            var b = new Edge(f, c2, -e);
            Edge.Link(a, b);
            G[f].Add(a);
            G[t].Add(b);
        }
        public class Edge {
            public static void Link(Edge e1, Edge e2) {
                e1.Rev = e2; e2.Rev = e1;
            }
            public int To { get; private set; }
            public Edge Rev { get; private set; }
            public V Cost { get; private set; }
            public C Cap { get; set; }
            public Edge(int t, C c, V e) {
                To = t;
                Cap = c;
                Cost = e;
            }
            public override string ToString() {
                return string.Format("to: {0}, cap: {1}", To, Cap);
            }
        }
    }
    #endregion
}
#region BinaryHeap
public class PriorityQueue<T> {
    readonly List<T> heap = new List<T>();
    readonly Comparison<T> compare;
    public PriorityQueue() { compare = Comparer<T>.Default.Compare; }

    public PriorityQueue(Comparison<T> comparison) { compare = comparison; }
    public PriorityQueue(IComparer<T> comparer) { compare = comparer.Compare; }

    public void Enqueue(T item) {
        var pos = heap.Count;
        heap.Add(item);
        while (pos > 0) {
            var par = (pos - 1) / 2;
            if (compare(heap[par], item) <= 0)
                break;
            heap[pos] = heap[par];
            pos = par;
        }
        heap[pos] = item;

    }

    public T Dequeue() {
        var ret = heap[0];
        var pos = 0;
        var x = heap[heap.Count - 1];

        while (pos * 2 + 1 < heap.Count - 1) {
            var lch = pos * 2 + 1;
            var rch = pos * 2 + 2;
            if (rch < heap.Count - 1 && compare(heap[rch], heap[lch]) < 0) lch = rch;
            if (compare(heap[lch], x) >= 0)
                break;
            heap[pos] = heap[lch];
            pos = lch;
        }
        heap[pos] = x;
        heap.RemoveAt(heap.Count - 1);
        return ret;

    }
    public T Peek() { return heap[0]; }
    public int Count { get { return heap.Count; } }
    public bool Any() { return heap.Count > 0; }

    public T[] Items {
        get {
            var ret = heap.ToArray();
            Array.Sort(ret, compare);
            return ret;
        }
    }
}
#endregion


Measured memory_bytes: 14868