#include<bits/stdc++.h>
using namespace std;
long long read(){
	long long ret=0,neg=1;
	char ch;
	ch=getchar();
	while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
	if(ch=='-'){
		neg=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		ret=(ret<<1)+(ret<<3)+(ch^48);
		ch=getchar();
	}
	return ret*neg;
}
void write(long long x){
	if(x<0) putchar('-'),x=-x;
	if(x>=10) write(x/10);
	putchar('0'+x%10);
}
unordered_map<long long,int> mp;
long long invmp[20010];
int idx;
int Pre[20010][510],Suf[20010][510];
vector<int> mpos[20010];
int rs[7];


int n,m;
int str[510][7];

int dis[20010][510];
set<int> unvis[20010];
int ans[510][510];
queue<pair<int,int> > q;

void Upd(int cstr,int lb,int rb,int del){
	set<int>::iterator it;
	/*if(cstr==1&&lb==0&&rb==3){
		cout<<"!!!\n";
		for(it=unvis[cstr].begin();it!=unvis[cstr].end();it++)
			cout<<(*it)<<' ';
		cout<<endl;
	}*/
	while(1){
		it=unvis[cstr].lower_bound(lb+1);
		if(it==unvis[cstr].end()) break;
		if((*it)>rb) break;
		dis[cstr][(*it)]=del+1;
		q.push(make_pair(cstr,(*it)));
		unvis[cstr].erase(it);
	}
}

void bfs(int st){
	memset(dis,0x3f,sizeof(dis));
	for(int i=1;i<=idx;++i){
		//unvis[i].clear();
		for(int j=0;j<mpos[i].size();++j){
			unvis[i].insert(mpos[i][j]);
		}
	}
	while(q.empty()==false) q.pop();
	for(int s=0;s<(1<<m);++s){
		long long cur=0;
		for(int j=m;j>=1;--j){
			cur=cur*1000ll;
			cur+=str[st][j]*((s>>(j-1))&1);
		}
		cur=mp[cur];
		dis[cur][st]=0;
		unvis[cur].erase(st);
		q.push(make_pair(cur,st));
	}
	while(q.empty()==false){
		long long cstr,pos;
		cstr=(q.front()).first;
		pos=(q.front()).second;
		q.pop();
		int np;
		//cout<<st<<' '<<cstr<<' '<<pos<<' '<<dis[cstr][pos]<<endl;
		np=Pre[cstr][pos];
		if(dis[cstr][np]>10000000){
			dis[cstr][np]=dis[cstr][pos]+1;
			q.push(make_pair(cstr,np));
			unvis[cstr].erase(np);
		}
		np=Suf[cstr][pos];
		if(dis[cstr][np]>10000000){
			dis[cstr][np]=dis[cstr][pos]+1;
			q.push(make_pair(cstr,np));
			unvis[cstr].erase(np);
		}
		long long tmp=invmp[cstr];
		for(int j=1;j<=m;++j){
			rs[j]=tmp%1000;
			tmp=(tmp-rs[j])/1000;
		}
		tmp=1;
		for(int j=1;j<=m;++j,tmp*=1000ll){
			if(rs[j]!=0) continue;
			long long nst;
			nst=invmp[cstr]+1ll*tmp*str[pos][j];
			nst=mp[nst];
			if(dis[nst][pos]>10000000){
				dis[nst][pos]=dis[cstr][pos]+1;
				q.push(make_pair(nst,pos));
				unvis[nst].erase(pos);
			}
		}
		tmp=1;
		for(int j=1;j<=m;++j,tmp*=1000ll){
			if(rs[j]==0) continue;
			long long nst;
			nst=invmp[cstr]-1ll*tmp*str[pos][j];
			//if(st==4&&cstr==19&&pos==4){
			////	cout<<"AAA "<<nst<<' '<<endl;
			//}
			nst=mp[nst];
			int lim=Pre[cstr][pos];
			//Upd(nst,);
			if(lim>=pos){
				Upd(nst,0,pos,dis[cstr][pos]);
				Upd(nst,lim,n,dis[cstr][pos]);
			}
			else{
				Upd(nst,lim,pos,dis[cstr][pos]);
			}
		}
	}
	int ccc=mp[0];
	for(int i=1;i<=n;++i){
		ans[i][st]=dis[ccc][i];
	}
}

int main(){
	//freopen("string.in","r",stdin);
	//freopen("string.out","w",stdout);
	n=read();
	m=read();
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			str[i][j]=read();
		}
		for(int s=0;s<(1<<m);++s){
			long long cur=0;
			for(int j=m;j>=1;--j){
				cur=cur*1000ll;
				cur+=str[i][j]*((s>>(j-1))&1);
			}
			if(mp[cur]==0){
				++idx;
				mp[cur]=idx;
				invmp[idx]=cur;
			}
		}
	}
	for(int i=1;i<=idx;++i){
		long long tmp=invmp[i];
		for(int j=1;j<=m;++j){
			rs[j]=tmp%1000;
			tmp=(tmp-rs[j])/1000;
		}
		for(int j=1;j<=n;++j){
			bool flag=true;
			for(int k=1;k<=m;++k){
				if(rs[k]==0||rs[k]==str[j][k]);
				else{
					flag=false;
					break;
				}
			}
			if(flag) mpos[i].emplace_back(j);
		}
		int lim=mpos[i].size();
		for(int j=0;j<lim;++j){
			if(j==0) Pre[i][mpos[i][j]]=mpos[i][lim-1];
			else Pre[i][mpos[i][j]]=mpos[i][j-1];
			if(j==lim-1) Suf[i][mpos[i][j]]=mpos[i][0];
			else Suf[i][mpos[i][j]]=mpos[i][j+1];
		}
	}
	/*for(int i=1;i<=idx;++i){
		cout<<"id: "<<i<<' '<<invmp[i]<<endl;
		for(int j=0;j<mpos[i].size();++j)
			cout<<mpos[i][j]<<' ';
		cout<<endl;
		for(int j=0;j<mpos[i].size();++j)
			cout<<Pre[i][mpos[i][j]]<<' ';
		cout<<endl;

		for(int j=0;j<mpos[i].size();++j)
			cout<<Suf[i][mpos[i][j]]<<' ';
		cout<<endl;
	}*/
	for(int i=1;i<=n;++i){
		bfs(i);
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			write(ans[i][j]);
			putchar(' ');
		}
		putchar('\n');
	}
	return 0;
}