import sys

# sys.setrecursionlimit(200005)
# 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 heapq import *

h,w=LI()
ss=[[c=="#" for c in SI()] for _ in range(h)]
dp=[0]*w
for i in range(h-2,-1,-1):
    pre,dp=dp,dp[:]
    mxj=-inf
    hp=[]
    ja=[]
    rem=[]
    for j in range(w):
        if ss[i][j]:
            dp[j]=inf
            continue
        while ja and ja[0][0]<j:
            d,pj=heappop(ja)
            mxj=max(mxj,pj)
            heappush(rem,d-pj)
        while rem and rem[0]==hp[0]:
            heappop(rem)
            heappop(hp)
        dp[j]=min(dp[j],j-mxj)
        if hp:dp[j]=min(dp[j],hp[0])
        heappush(ja,(j+pre[j],j))
        heappush(hp,pre[j])

    mnj=inf
    hp=[]
    ja=[]
    rem=[]
    for j in range(w)[::-1]:
        if ss[i][j]:continue
        while ja and -ja[0][0]>j:
            d,pj=heappop(ja)
            mnj=min(mnj,pj)
            heappush(rem,d+pj)
        while rem and rem[0]==hp[0]:
            heappop(rem)
            heappop(hp)
        dp[j]=min(dp[j],mnj-j)
        if hp:dp[j]=min(dp[j],hp[0])
        heappush(ja,(-j+pre[j],j))
        heappush(hp,pre[j])

    # print(dp)
print(*dp,sep="\n")