import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import deque

n, m = LI()
m += 1
aa = LI1()
dist = [inf]*(n*m)
q = deque()
q.append((m-1)*n)
dist[(m-1)*n] = 0
while q:
    u = q.popleft()
    i, j = divmod(u, n)
    if i:
        if aa[i-1] == j:
            v = (i-1)*n+j+1
            if dist[v] > dist[u]:
                dist[v] = dist[u]
                q.appendleft(v)
        elif aa[i-1] == j-1:
            v = (i-1)*n+j-1
            if dist[v] > dist[u]:
                dist[v] = dist[u]
                q.appendleft(v)
        else:
            v = (i-1)*n+j
            if dist[v] > dist[u]:
                dist[v] = dist[u]
                q.appendleft(v)
    if j:
        v = i*n+j-1
        if dist[v] > dist[u]+1:
            dist[v] = dist[u]+1
            q.append(v)
    if j+1 < n:
        v = i*n+j+1
        if dist[v] > dist[u]+1:
            dist[v] = dist[u]+1
            q.append(v)

print(*dist[1:n])