from collections import defaultdict as dd
import bisect

N,Q = map(int, input().split())
A = list(map(int, input().split()))
B = [0]+list(map(int, input().split()))
idx = dd(list)
idx[0].append(0)
for i in range(N):
    idx[A[i]].append(i)
ans = 0
pre = 0

dp = [ [float("inf") for i in range(N)] for _ in range(Q+1) ]
dp[0][0] = 0

for i in range(1, Q+1):
    """
    r = bisect.bisect_left(idx[B[i]], pre)
    r = min(len(idx[B[i]])-1,r)
    l = max(0, r-1)
    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]
    """
    for j in idx[B[i]]:
        for k in idx[B[i-1]]:
            dp[i][j] = min(dp[i][j], dp[i-1][k]+abs(k-j))
#for i in range(Q+1):
#    print(dp[i])
print(min(dp[-1]))