#include <bits/stdc++.h>
using namespace std;
//#define int long long
int n,k,a[510][510],cnt[510][510][510],ans[510][510];
bool check(int i,int j,int p)
{
	int pcnt=0;
	for(int t=1;t<=n;t++)
		if(cnt[i+p-1][j+p-1][t]-cnt[i-1][j+p-1][t]-cnt[i+p-1][j-1][t]+cnt[i-1][j-1][t])
			pcnt++;
//	cout<<" "<<i<<" "<<j<<" "<<p<<" "<<pcnt<<" "<<k<<" "<<(pcnt<=k)<<endl;
	return (pcnt<=k);
}
signed main()
{
//	freopen("A.in","r",stdin);
//	freopen("A.out","w",stdout);
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			scanf("%d",&a[i][j]);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			for(int k=1;k<=n;k++)
				cnt[i][j][k]=cnt[i-1][j][k]+cnt[i][j-1][k]-cnt[i-1][j-1][k]+(a[i][j]==k);
//	for(int i=1;i<=n+1;i++)ans[i][n+1]=ans[n+1][i]=n;
	for(int i=n;i>=1;i--)
		for(int j=n;j>=1;j--)
		{
//			cout<<i<<" "<<j<<" "<<r<<endl;
			if(check(i,j,ans[i+1][j+1]+1))
			{
//				cout<<i<<" "<<j<<" "<<ans[i+1][j+1]+1<<endl;
				ans[i][j]=ans[i+1][j+1]+1;
				continue;
			}
			int l=1,r=min(ans[i+1][j+1],min(n-i+1,n-j+1));
			while(l<=r)
			{
				int mid=l+r>>1;
				int pcnt=0;
				if(check(i,j,mid))ans[i][j]=mid,l=mid+1;
				else r=mid-1;
			}
		}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
			printf("%d ",ans[i][j]);
		printf("\n");
	}
	return 0;
}