#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#if __cplusplus > 201403L
#define r
#else
#define r register
#endif

#define c const

namespace _c
{
c double pi = acos(-1.0);
namespace min
{
c int i8 = -128;
c int i16 = -32768;
c int i = -2147483647 - 1;
c ll l = -9223372036854775807LL - 1;
} // namespace min

namespace max
{
c int i8 = 127;
c int i16 = 32767;
c int i = 2147483647;
c ll l = 9223372036854775807LL;
} // namespace max
} // namespace _c

namespace _f
{
template <typename T>
inline c T gcd(T m, T n)
{
    while (n != 0)
    {
        T t = m % n;
        m = n;
        n = t;
    }
    return m;
}

template <typename T>
inline c T abs(c T &a)
{
    return a > 0 ? a : -a;
}

template <typename T>
inline T pow(T a, T b)
{
    T res = 1;
    while (b > 0)
    {
        if (b & 1)
        {
            res = res * a;
        }
        a = a * a;
        b >>= 1;
    }
    return res;
}

template <typename T>
inline T pow(T a, T b, c T &m)
{
    a %= m;
    T res = 1;
    while (b > 0)
    {
        if (b & 1)
        {
            res = res * a % m;
        }
        a = a * a % m;
        b >>= 1;
    }
    return res % m;
}
} // namespace _f
namespace io
{
template <typename T>
inline T read()
{
    r T res = 0, neg = 1;
    char g = getchar();
    for (; !isdigit(g); g = getchar())
    {
        if (g == '-')
        {
            neg = -1;
        }
    }
    for (; isdigit(g); g = getchar())
    {
        res = res * 10 + g - '0';
    }
    return res * neg;
}
template <typename T>
inline void read(T &t)
{
    t = read<T>();
}
template <typename T>
inline void readln(c T first, c T last)
{
    for (r T it = first; it != last; it++)
    {
        read(*it);
    }
}

template <typename T>
inline void _write(T x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
    {
        _write(x / 10);
    }
    putchar(x % 10 + '0');
}
template <typename T>
inline void write(c T &x, c char &sep = ' ')
{
    _write(x);
    putchar(sep);
}
template <typename T>
inline void writeln(c T &x)
{
    write(x, '\n');
}
template <typename T>
inline void writeln(c T first, c T last, c char &sep = ' ', c char &ends = '\n')
{
    for (r T it = first; it != last; it++)
    {
        write(*it, sep);
    }
    putchar(ends);
}

#if __cplusplus >= 201103L
template <typename T, typename... Args>
void read(T &x, Args &... args)
{
    read(x);
    read(args...);
}
#endif
} // namespace io
#undef c
#undef r
int n,m,a[505][505],cnt[505][505][505],l,r,mid,ans[505][505],tmp;
bool check(int x1,int y1,int p){
	int x2=x1+p-1,y2=y1+p-1,res=0;
	for(int i=1;i<=n;i++)
		if(cnt[x2][y2][i]-cnt[x2][y1-1][i]-cnt[x1-1][y2][i]+cnt[x1-1][y1-1][i])
			res++;
//	cout<<x1<<' '<<y1<<' '<<x2<<' '<<y2<<' '<<p<<' '<<res<<' '<<"boom"<<endl;
	return res<=m;
}
int main(){
//	freopen("ex_square.in","r",stdin);
//	freopen("ex_square.out","w",stdout);
	io::read(n),io::read(m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			io::read(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=n;i>=1;i--){
		for(int j=n;j>=1;j--){
			if(i==n||j==n){
				ans[i][j]=1;
				continue;
			}
			if(check(i,j,ans[i+1][j+1]+1)){
				ans[i][j]=ans[i+1][j+1]+1;
				continue;
			}
			l=1,r=min({n-i+1,n-j+1,ans[i+1][j+1]+1}),tmp=0;
			while(l<=r){
				mid=l+r>>1;
				if(check(i,j,mid))
					tmp=mid,l=mid+1;
				else
					r=mid-1;
			}
//			printf("%d ",tmp);
			ans[i][j]=tmp;
		}
//		puts("");
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<n;j++)
			io::write(ans[i][j],' ');
		io::writeln(ans[i][n]);
	}
	return 0;
}