#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<string> a(n+5);
	for(int i=1;i<n;i++)
	{
		string s;
		cin>>s;
		a[i]=' '+s;
	}
	auto hs=[&](int x,int y)
	{
		return (x-1)*m+y;
	};
	vector<vector<int>> G(n*m+5);
	vector<int> deg(n*m+5);
	auto addedge=[&](int u,int v)
	{
//		cerr<<"addedge "<<u<<' '<<v<<endl;
		G[u].push_back(v);
		deg[v]++;
	};
	//0:down, 1:up
	vector<vector<int>> ty(n+5,vector<int>(m+5));
	for(int i=1;i<n;i++)
	{
		for(int j=1;j<m;j++)
		{
			if(a[i][j]=='1')
			{
				if(ty[i][j])
				{
					ty[i][j+1]=1;
					addedge(hs(i+1,j),hs(i+1,j+1));
					addedge(hs(i+1,j+1),hs(i,j));
					addedge(hs(i,j),hs(i,j+1));
				}
				else
				{
					ty[i][j+1]=0;
					addedge(hs(i,j),hs(i,j+1));
					addedge(hs(i,j+1),hs(i+1,j));
					addedge(hs(i+1,j),hs(i+1,j+1));
				}
			}
			else if(a[i][j]=='2')
			{
				if(ty[i][j])
				{
					ty[i][j+1]=0;
					addedge(hs(i+1,j),hs(i,j));
					addedge(hs(i,j),hs(i,j+1));
					addedge(hs(i,j+1),hs(i+1,j+1));
				}
				else
				{
					ty[i][j+1]=1;
					addedge(hs(i,j),hs(i+1,j));
					addedge(hs(i+1,j),hs(i+1,j+1));
					addedge(hs(i+1,j+1),hs(i,j+1));
				}
			}
			else
			{
				if(ty[i][j])
				{
					ty[i][j+1]=1;
					addedge(hs(i+1,j),hs(i,j));
					addedge(hs(i,j),hs(i+1,j+1));
					addedge(hs(i+1,j+1),hs(i,j+1));
				}
				else
				{
					ty[i][j+1]=0;
					addedge(hs(i,j),hs(i+1,j));
					addedge(hs(i+1,j),hs(i,j+1));
					addedge(hs(i,j+1),hs(i+1,j+1));
				}
			}
		}
	}
	vector<int> ans(n*m+5);
	queue<int> q;
	for(int i=1;i<=n*m;i++)
	{
		if(deg[i]==0)q.push(i);
	}
	int idx=0;
	while(not q.empty())
	{
		int u=q.front();q.pop();
		ans[u]=++idx;
		for(auto v:G[u])
		{
			deg[v]--;
			if(deg[v]==0)
			{
				q.push(v);
			}
		}
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			cout<<ans[hs(i,j)]<<" \n"[j==m];
		}
	return 0;
}