N, M = map(int, input().split())
A = list(map(int, input().split()))
A = [a - 1 for a in A]

dp = [[1e9] * N for _ in range(M + 1)]

for i in range(N):
    dp[M][i] = i

for i in reversed(range(M)):
    for j in range(N):
        if j == A[i]:
            dp[i][j] = dp[i + 1][j + 1]
        elif j == A[i] + 1:
            dp[i][j] = dp[i + 1][j - 1]
        else:
            dp[i][j] = dp[i + 1][j]
    for j in range(N - 1):
        dp[i][j] = min(dp[i][j], dp[i][j + 1] + 1)
        dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + 1)

print(*dp[0][1:])