#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,K,a[501][501],f[501],fl[501][501]; 
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>K;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1,k,s;j<=n;j++){
			if(i==n||j==n){
				cout<<1<<" ";
				continue;
			}
			if(fl[i][j]==1){
				cout<<min(n-i,n-j)+1<<" ";
				continue;
			}
			for(k=1,s=0;k<=min(n-i,n-j)+1&&s<=K;k++){
				for(int l=1;l<=k;l++){
					//cout<<l<<" "<<k<<" "<<a[l+i-1][k+j-1]<<" "<<f[a[l+i-1][k+j-1]]<<endl;
					if(f[a[l+i-1][k+j-1]]++==0){
						if(++s>K){
							break;
						}
					}
				}
				if(s>K){
					break;
				}
				for(int l=1;l<k;l++){
					//cout<<k<<" "<<l<<" "<<a[k+i-1][l+j-1]<<" "<<f[a[k+i-1][l+j-1]]<<endl;
					if(f[a[k+i-1][l+j-1]]++==0){
						if(++s>K){
							break;
						}
					}
				}
				if(s>K){
					break;
				}
				//cout<<"s:"<<s<<endl;
			}
			cout<<k-1<<" ";
			if(k+i-2==n&&i==j){
				for(int l=i;l<=n;l++){
					for(int m=j;m<=n;m++){
						fl[l][m]=1;
					}
				}
			}
			memset(f,0,sizeof(f));
		}
		cout<<endl;
	}
	return 0;
}