# dp[i][j] : i におり, いまプレゼントが j にいる.

n, m = map(int,input().split())
a = list(map(int,input().split()))

dp = [[10 ** 9] * (n) for i in range(m + 1)]
dp[m][0] = 0

for i in range(m-1, -1, -1):
	tmp = [10 ** 9] * n
	for j in range(n):
		for k in range(n):
			tmp[k] = min(tmp[k], dp[i + 1][j] + abs(j-k))
	
	tmp[a[i] - 1], tmp[a[i]] = tmp[a[i]], tmp[a[i] - 1]
	dp[i] = tmp

tmp = [10 ** 9] * n
for j in range(n):
	for k in range(n):
		tmp[k] = min(tmp[k], dp[0][j] + abs(j-k))

print(*tmp[1:])