#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;
  map<int, vector<int>> A;
  vector<int> B(Q);
  rep(i, N) {
    int Ai;
    cin >> Ai;
    A[Ai].push_back(i);
  }
  ll c = 0;
  int pos = 0;
  rep(i, Q) {
    int Bi;
    cin >> Bi;
    int n = A[Bi].size();
    int p = 0;
    if (n == 1 || pos < A[Bi][0])
      p = A[Bi][0];
    else if (A[Bi][n - 1] < pos)
      p = A[Bi][n - 1];
    else {
      vector<int> v = A[Bi];
      int pl = lower_bound(v.begin(), v.end(), pos) - v.begin();
      int pu = upper_bound(v.begin(), v.end(), pos) - v.begin();
      if (abs(pl - pos) < abs(pu - pos))
	p = pl;
      else
	p = pu;
    }
    c += abs(p - pos);
    pos = p;
  }
  cout << c << endl;
  return 0;
}