// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 1e14;
const int LOG=17;
const int N=30+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
int a[N][N][N][N];
int b[N][N][N][N];
int a1[N][N][N][N];
int a2[N][N][N][N];
int a3[N][N][N][N];
int a4[N][N][N][N];
void solve(){
cin >> n >> m;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
for (int k=0;k<n;k++){
for (int l=0;l<n;l++){
cin >> a[i][j][k][l];
}
}
}
}
priority_queue<pair<int,int>>p,q;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
for (int k=0;k<n;k++){
for (int l=0;l<n;l++){
cin >> a[i][j][k][l];
a1[i][j][k][l]=a2[i][j][k][l]=a3[i][j][k][l]=a4[i][j][k][l]=inf;
}
}
}
}
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
for (int k=0;k<n;k++){
p=q;
for (int l=n-1;l>=n-m+1;l--){
p.push({-a[i][j][k][l],l});
}
for (int l=n-m;l>=0;l--){
p.push({-a[i][j][k][l],l});
while (p.top().se>=l+m)p.pop();
a1[i][j][k][l]=-p.top().fi;
}
}
for (int l=0;l<n;l++){
p=q;
for (int k=n-1;k>=n-m+1;k--){
p.push({-a1[i][j][k][l],k});
}
for (int k=n-m;k>=0;k--){
p.push({-a1[i][j][k][l],k});
while (p.top().se>=k+m)p.pop();
a2[i][j][k][l]=-p.top().fi;
}
}
}
for (int k=0;k<n;k++){
for (int l=0;l<n;l++){
p=q;
for (int j=n-1;j>=n-m+1;j--){
p.push({-a2[i][j][k][l],j});
}
for (int j=n-m;j>=0;j--){
p.push({-a2[i][j][k][l],j});
while (p.top().se>=j+m)p.pop();
a3[i][j][k][l]=-p.top().fi;
}
}
}
}
for (int j=0;j<n;j++){
for (int k=0;k<n;k++){
for (int l=0;l<n;l++){
p=q;
for (int i=n-1;i>=n-m+1;i--){
p.push({-a3[i][j][k][l],i});
}
for (int i=n-m;i>=0;i--){
p.push({-a3[i][j][k][l],i});
while (p.top().se>=i+m)p.pop();
a4[i][j][k][l]=-p.top().fi;
}
}
}
}
for (int i=0;i<n-m+1;i++){
for (int j=0;j<n-m+1;j++){
for (int k=0;k<n-m+1;k++){
for (int l=0;l<n-m+1;l++){
cout << a4[i][j][k][l] << " ";
}
}
}
}
cout << endl;
}
signed main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r" ,stdin);
// freopen("output.txt","w",stdout);
// #endif
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(4);
srand(time(0));
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
