N,M=map(int, input().split())
A=list(map(int, input().split()))
dp=[1000]*(N*N)
#dp[i][j]:iの荷物をjに持ってくるのに必要な最小回数
for i in range(N):
  dp[N*i+i]=0
now=1000

for i in range(N):
  for j in range(1,N):
    dp[i*N+j]=min(dp[i*N+j],dp[i*N+j-1]+1)
  for j in range(N-2,-1,-1):
    dp[i*N+j]=min(dp[i*N+j],dp[i*N+j+1]+1)

for a in A:
  for i in range(N):
    dp[i*N+a-1],dp[i*N+a]=dp[i*N+a],dp[i*N+a-1]
  for i in range(N):
    for j in range(1,N):
      dp[i*N+j]=min(dp[i*N+j],dp[i*N+j-1]+1)
    for j in range(N-2,-1,-1):
      dp[i*N+j]=min(dp[i*N+j],dp[i*N+j+1]+1)

ans=[]
for i in range(1,N):
  ans.append(dp[i*N])
print(*ans)