50 50
75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10 62 48 52 69 87 97 95 30 74 21 42 36 64 31 80 81 50 56 53 33 99
26 30 5 33 35 29 6 15 36 17 32 16 14 1 29 34 22 40 12 42 38 48 39 50 13 47 18 43 10 8 49 45 11 31 21 37 46 28 20 41 2 7 9 24 27 23 3 44 15 14
 10 10
61 59 97 16 2 94 57 48 91 93
2 8 6 5 3 1 3 4 9 10
 2 1
1 2
1
 3 3
10 20 30
1 2 3
 50 60
86 57 45 93 17 12 40 10 47 80 18 80 3 9 6 55 13 99 5 76 4 70 100 55 27 91 71 3 65 93 41 74 80 56 90 50 58 13 71 9 47 52 26 73 72 21 15 81 88 28
40 32 5 16 49 23 3 17 14 10 1 15 1 21 28 22 13 45 12 25 44 48 46 32 36 43 11 8 49 7 7 35 10 14 39 4 42 10 30 27 1 17 31 15 8 41 44 33 25 26 19 18 29 37 50 6 36 38 47 9
 2 7
20 30
1 1 1 2 2 2 2
 2 2
10 12
2 1
 5 1
16 87 36 16 81
3
 2 3
20 30
1 1 1
 2 10
39 26
1 1 2 2 2 2 2 2 1 2

63929
 2137
 0
 40
 62514
 20
 12
 0
 0
 104

import java.util.*;
import java.util.Map.Entry;
import java.io.*;
import java.awt.Point;
import java.math.BigInteger;

import static java.lang.Math.*;

public class CodeforcesC implements Runnable {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                return null;
            }
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    public static void main(String[] args) {
        new Thread(null, new CodeforcesC(), "", 128 * (1L << 20)).start();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    long memoryTotal, memoryFree;

    void memory() {
        memoryFree = Runtime.getRuntime().freeMemory();
        System.err.println("Memory = " + ((memoryTotal - memoryFree) >> 10)
                + " KB");
    }

    void debug(Object... objects) {
        if (DEBUG) {
            for (Object o : objects) {
                System.err.println(o.toString());
            }
        }
    }

    int[] readIntArray(int n) throws IOException {
        int[] array = new int[n];
        for (int i = 0; i < n; i++)
            array[i] = readInt();
        return array;
    }

    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            memoryTotal = Runtime.getRuntime().freeMemory();
            init();
            solve();
            out.close();
            time();
            memory();
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }

    boolean DEBUG = false;

    void solve() throws IOException {

        int n = readInt();
        int m = readInt();

        int[] w = new int[n];

        for (int i = 0; i < n; i++)
            w[i] = readInt();

        TreeSet<Integer>[] set = new TreeSet[m];
        for (int i = 0; i < m; i++)
            set[i] = new TreeSet<Integer>();

        int[][] column = new int[n][m];
        for (int i = 0; i < m; i++) {
            column[0][i] = readInt();
            set[i].add(column[0][i]);
        }

        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                int mustBe = column[i - 1][j - 1];
                if (!set[j].contains(mustBe)) {
                    column[i][j] = mustBe;
                    set[j].add(mustBe);
                    continue;
                }
                mustBe = j == m - 1 ? -1 : column[0][j + 1];
                if (mustBe > 0 && !set[j].contains(mustBe)) {
                    column[i][j] = mustBe;
                    set[j].add(mustBe);
                    continue;
                }
                mustBe = column[i][j - 1];
                if (!set[j].contains(mustBe)) {
                    column[i][j] = mustBe;
                    set[j].add(mustBe);
                    continue;
                }

                for (int k = 1; k <= n; k++) {
                    if (!set[j].contains(k)) {
                        column[i][j] = k;
                        set[j].add(k);
                        break;
                    }
                }
            }
            int mustBe = column[0][1];
            if (!set[0].contains(mustBe)) {
                column[i][0] = mustBe;
                set[0].add(mustBe);
                continue;
            }

            for (int k = 1; k <= n; k++) {
                if (!set[0].contains(k)) {
                    column[i][0] = k;
                    set[0].add(k);
                    break;
                }
            }
        }

        Arrays.sort(w);

        int answer = 0;
        for (int i = 0; i < m - 1; i++) {
            int sum = 0;
            for (int j = 0; j < n; j++) {
                if (column[j][i] == column[0][i + 1]) {
                    answer += sum;
                    break;
                } else
                    sum += w[column[j][i] - 1];
            }
        }

        out.println(answer);
    }
}