import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
D = dict()
for i, a in enumerate(A):
    if a not in D:
        D[a] = [i]
    else:
        D[a].append(i)
#print(D)
INF = 10**9
dp = [[INF for _ in range(N)] for _ in range(Q+1)]
dp[0][0] = 0
for i in range(Q):
    for j in range(N):
        if dp[i][j]==INF:
            continue
        b = B[i]
        for k in D[b]:
            dp[i+1][k] = min(dp[i+1][k], dp[i][j] + abs(k-j))
#print(dp)
ans = INF
for d in dp[Q]:
    ans = min(ans, d)
print(ans)