import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
n,m = map(int,input().split())
a = list(map(int,input().split()))
ans = [10**18 for i in range(n)]

res = [list(range(n))]
for i in range(m):
    res.append(res[-1][:])
    res[-1][a[i]-1],res[-1][a[i]] = res[-1][a[i]], res[-1][a[i]-1]
#print(res)
dp = [[10**18 for i in range(n)] for j in range(m+1)]
x = res[-1][0]
for i in range(m+1):
    for j in range(n):
        if res[i][j] == x:
            dp[i][j] = 0
for i in reversed(range(m+1)):
    for j in range(n):
        if i != m:
            if j != 0 and res[i+1][j-1] == res[i][j]:
                dp[i][j] = min(dp[i][j],dp[i+1][j-1])
            if res[i+1][j] == res[i][j]:
                dp[i][j] = min(dp[i][j],dp[i+1][j])
            if j != n-1 and res[i+1][j+1] == res[i][j]:
                dp[i][j] = min(dp[i][j],dp[i+1][j+1])
        if j != 0:
            dp[i][j] = min(dp[i][j-1]+1,dp[i][j])
for i in range(1,n):
    print(dp[0][i],end=' ')
#print(dp)