#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>

using namespace std;

int n,m,a[200][200],ans[200][200];
int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};

struct Node{
	int x,y;
};
queue<Node>q; 

bool check(int i,int j)
{
	if(i>=1&&i<=n&&j>=1&&j<=m&&a[i][j]!=0)
	return true;
	else return false;
}

void bfs()
{
	while(!q.empty())
	{
		int xx=q.front().x,yy=q.front().y;
		q.pop();
			for(int k=0;k<4;k++){
				int u=xx+d[k][0],v=yy+d[k][1];
				if(check(u,v)){
					if(a[u][v]==-1){
						a[u][v]=a[xx][yy]+1;
						q.push((Node){u,v});
					}
					else{
						if(a[u][v]>a[xx][yy]+1){
							a[u][v]=a[xx][yy]+1;
							q.push((Node){u,v});
						}
					}
				}
			}
	}
}

int main()
{
	freopen("bit.in","r",stdin);
	freopen("bit.out","w",stdout);
	memset(ans,0x3f,sizeof(ans));
	memset(a,-1,sizeof(a));
	char ch;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			cin>>ch;
			if(ch=='1'){
				a[i][j]=0; 
				Node w; w.x=i,w.y=j;
				q.push(w);
			}
		}
	bfs();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
		printf("%d ",a[i][j]);
		printf("\n");
	}			
	return 0;
}