#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long int;

int main() {
  int N, Q;
  cin >> N >> Q;
  vector<int> A(N);
  map<int, vector<int>> a;
  vector<int> B(Q);
  rep(i, N) {
    cin >> A[i];
    a[A[i]].push_back(i);
  }
  ll c = 0;
  int pos = 0;
  rep(i, Q) {
    int Bi;
    cin >> Bi;
    int p = lower_bound(a[Bi].begin(), a[Bi].end(), pos) - a[Bi].begin();
    if (p == (int)a[Bi].size())
      p--;
    while (p+1 < (int)a[Bi].size() &&
	   A[a[Bi][p+1]] == Bi &&
	   abs(pos - a[Bi][p+1]) < abs(pos - a[Bi][p]))
      p = p + 1;
    c += abs(a[Bi][p] - pos);
    pos = a[Bi][p];
  }
  cout << c << endl;
  return 0;
}