// 1번 안
if(1 <= cx && cx <= n && 1 <= cy && cy <= m && mmap[cx][cy] != 0 && check[cx][cy] == false){
    // 로직이 들어가는 부분
}

//2번 안

if (1 <= cx && cx <= n && 1 <= cy && cy <= m){
    if (mmap[cx][cy] != 0 && check[cx][cy] == false){
    	//로직이 들어가는 부분
	}
}

//3번 안

if (!(1 <= cx && cx <= n && 1 <= cy && cy <= m)) continue;
if (!(mmap[cx][cy] != 0 && check[cx][cy] == false)) continue;
// 로직이 들어가는 부분

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>

using namespace std;
#define INF 1234567890

int dx[4] = { 0,0,1,-1 };
int dy[4] = { 1,-1,0,0 };
int mmap[1005][1005];
bool check[1005][1005];
int result[1005][1005];
int x, y;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> mmap[i][j];
			if (mmap[i][j] == 2)
				x = i, y = j;
		}
	}
	

	queue<pair<int, int>> que;
	que.push({ x, y });
	check[x][y] = true;

	while (!que.empty()) {
		pair<int, int> cur_node = que.front();
		que.pop();
		for (int i = 0; i < 4; i++) {
			int cx = cur_node.first + dx[i];
			int cy = cur_node.second + dy[i];
			if (!(1 <= cx && cx <= n && 1 <= cy && cy <= m)) continue;
			if (!(mmap[cx][cy] != 0 && check[cx][cy] == false)) continue;
			
			check[cx][cy] = true;
			result[cx][cy] = result[cur_node.first][cur_node.second] + 1;
			que.push({cx, cy});
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (check[i][j] == false && mmap[i][j] != 0)
				cout << -1 << ' ';
			else
				cout << result[i][j] << ' ';

		}
		cout << "\n";
	}

	return 0;
}