R=range
J=lambda:map(int,input().split())
N,M=J()
A=list(J())
P=[]
V=N*M+N
E=[]
for v in R(V):
	i,j,e=v//N,v%N,[]
	if i:a,n=A[i-1],i*N-N;e+=[[n+(a if j==a-1else a-1if j==a else j),0]]
	if j:e+=[[i*N+j-1,1]]
	if j+1<N:e+=[[i*N+j+1,1]]
	E+=[e]
import heapq
W=[9**20]*V
F=[0]*V
W[M*N]=0
Q=[[0,M*N]]
while len(Q):
	w,i=heapq.heappop(Q);F[i],C=1,set()
	if w>W[i]:continue
	for[j,v]in E[i]:
		if F[j]<1:
			u=w+v
			if u<W[j]:W[j]=u;C.add(j)
	for j in C:heapq.heappush(Q,[W[j],j])
print(*W[1:N])