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

#include <bits/stdc++.h>
using namespace std;
int t[100100];
vector<int> Per;
void build(int a[], int v, int tl, int tr) {
  if (tl == tr)
    t[v] = a[Per[tl]];
  else {
    int tm = (tl + tr) / 2;
    build(a, v * 2, tl, tm);
    build(a, v * 2 + 1, tm + 1, tr);
    t[v] = t[v * 2] + t[v * 2 + 1];
  }
}
int sum(int v, int tl, int tr, int l, int r) {
  if (l > r) return 0;
  if (l == tl && r == tr) return t[v];
  int tm = (tl + tr) / 2;
  return sum(v * 2, tl, tm, l, min(r, tm)) +
         sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}
void update(int v, int tl, int tr, int pos, int new_val) {
  if (tl == tr)
    t[v] = new_val;
  else {
    int tm = (tl + tr) / 2;
    if (pos <= tm)
      update(v * 2, tl, tm, pos, new_val);
    else
      update(v * 2 + 1, tm + 1, tr, pos, new_val);
    t[v] = t[v * 2] + t[v * 2 + 1];
  }
}
int w[1000];
bool f[1000];
set<int> S;
vector<int> C;
int main() {
  int n, m, i, j;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; ++i) {
    scanf("%d", &w[i]);
    S.insert(i);
  }
  for (j = 1; j <= m; ++j) {
    scanf("%d", &i);
    if (f[i - 1] == false) {
      Per.push_back(i - 1);
      f[i - 1] = true;
    }
    C.push_back(i - 1);
  }
  while (S.size()) {
    j = *S.begin();
    if (!f[j]) Per.push_back(j);
    S.erase(j);
  }
  build(w, 1, 0, n - 1);
  int sc = 0;
  reverse(C.begin(), C.end());
  while (C.size()) {
    for (i = 0; i < n; ++i)
      if (Per[i] == C[C.size() - 1]) break;
    sc += sum(1, 0, n - 1, 0, i - 1);
    int a, b;
    a = w[Per[0]];
    b = w[Per[i]];
    update(1, 0, n - 1, 0, b);
    update(1, 0, n - 1, i, a);
    while (i > 0) {
      swap(Per[i], Per[i - 1]);
      i--;
    }
    C.pop_back();
  }
  printf("%d", sc);
  return 0;
}
