#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<algorithm>
#define ll long long
using namespace std;
int n,m,xa,b,f,l;
int a[185][185];
int dx[8]={-1,0,0,1};
int dy[8]={0,-1,1,0};
struct node{
    int x,y,ans;
};
queue<node> q;
int bfs(){
	while(!q.empty()){
		int xx=q.front().x;
        int yy=q.front().y;
		int ans=q.front().ans;
		for(int i=0;i<4;i++){
            if(ans+1<a[xx+dx[i]][yy+dy[i]]&&xx+dx[i]>=1&&xx+dx[i]<=n&&yy+dy[i]>=1&&yy+dy[i]<=m){
            	a[xx+dx[i]][yy+dy[i]]=ans+1;
                q.push({xx+dx[i],yy+dy[i],ans+1});
            }
		}
		q.pop();
	}
	
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		for(int j=0;j<m;j++){
			a[i][j+1]=s[j]-'0';
			if(a[i][j+1]==1){
				a[i][j+1]=0;
				q.push({i,j+1,0});
			}
			else{
				a[i][j+1]=100000;
			}
		}
	}
	bfs();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}