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;
const long long MOD = 1000000007;
const long long MOD1 = 998244353;
const long long MIN_LL = -1e18;
const long long MAX_LL = 1e18;
const int MAX_INT = 1e9;
const int MIN_INT = -1e9;
const long double pie = 3.1415926535;
long long fpow(long long n, long long p) {
  ;
  long long m = 1;
  while (p) {
    if (p % 2) m *= n;
    p >>= 1;
    n *= n;
  }
  return m;
}
long long mfpow(long long n, long long p, long long M) {
  long long m = 1;
  n %= M;
  while (p) {
    if (p % 2) m = (m * n) % M;
    n = (n * n) % M;
    p >>= 1;
  }
  return m % M;
}
template <class T>
inline ostream& operator<<(ostream& o, vector<T> v) {
  for (auto i : v) o << i << " ";
  return o;
};
template <class T>
inline ostream& operator<<(ostream& o, set<T> s) {
  for (auto i : s) o << i << " ";
  return o;
}
template <class T>
inline ostream& operator<<(ostream& o, multiset<T> s) {
  for (auto i : s) cout << i << " ";
  return o;
}
template <class T1, class T2>
inline ostream& operator<<(ostream& o, pair<T1, T2> p) {
  o << p.first << " " << p.second << "\n";
  return o;
}
template <class T1, class T2>
inline ostream& operator<<(ostream& o, map<T1, T2> m) {
  for (auto p : m) o << p.first << " " << p.second << "\n";
  return o;
}
const vector<long long> days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool br, br1, br2;
char ch, ch1, ch2;
long long n, m, k, x, y, z, mini, maxi, l, r, sum, t, w;
pair<long long, long long> p, p1, p2;
string s, s1, s2;
set<long long> st, st1, st2;
multiset<long long> mst;
map<long long, long long> mp;
long long a[(int)1e6 + 100];
long long b[(int)1e6 + 100];
long long ind[(int)1e6 + 100];
void solve() {
  cin >> n >> m;
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0; i < m; i++) {
    cin >> b[i];
    x = ind[b[i]];
    st.clear();
    for (long long j = x; j < i; j++) st.insert(b[j]);
    for (auto i : st) sum += i;
    ind[b[i]] = i + 1;
  }
  cout << sum << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
