from collections import deque
import sys

input = sys.stdin.readline
n, m = map(int, input().split())
graph = []
start_x, start_y = -1, -1
for i in range(n):
    row = list(map(int, input().split()))
    graph.append(row)
    for j in range(m):
        if row[j] == 2:
            start_x, start_y = i, j

distance = [[-1] * m for _ in range(n)]
distance[start_x][start_y] = 0

q = deque([(start_x, start_y)])
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]

while q:
    x, y = q.popleft()
    for i in range(4):
        nx, ny = x + dx[i], y + dy[i]
        if 0 <= nx < n and 0 <= ny < m and distance[nx][ny] == -1 and graph[nx][ny] == 1:
            distance[nx][ny] = distance[x][y] + 1
            q.append((nx, ny))

for i in range(n):
    for j in range(m):
        if graph[i][j] == 0:
            print(0, end=" ")
        else:
            print(distance[i][j], end=" ")
    print()