from collections import defaultdict as dd
import bisect

N,Q = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
idx = dd(list)
for i in range(N):
    idx[A[i]].append(i)
ans = 0
pre = 0
for i in range(Q):
    #print("###")
    #print(pre)
    r = bisect.bisect_left(idx[B[i]], pre)
    r = min(len(idx[B[i]])-1,r)
    l = max(0, r-1)
    #print(idx[B[i]][r],idx[B[i]][l])
    #print("###")
    if abs(idx[B[i]][r]-pre)<abs(idx[B[i]][l]-pre):
        ans += abs(idx[B[i]][r]-pre)
        pre = idx[B[i]][r]
    else:
        ans += abs(idx[B[i]][l]-pre)
        pre = idx[B[i]][l]
print(ans)