#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
const int N = 2e5+5;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int a,b,c,d;
int n , m , k , q;
vector<vector<vector<vector<int>>>>X;
int sol(int as,int bs,int cs,int ds){
int an = inf;
for(int i = as;i<min(as+m,a);i++){
for(int j = bs;j<min(bs+m,b);j++){
for(int k = cs;k<min(cs+m,c);k++){
for(int l = ds;l<min(ds+m,d);l++){
an = min(an,X[i][j][k][l]);
}
}
}
}
return an;
}
void solve(int testcase_number){
cin>>n>>m;
vector<int>arr;
int y;
while(cin>>y){
arr.pb(y);
}
int p1 =0;
int sz = arr.size();
for(int i = 0;i<n;i++){
vector<vector<vector<int>>>vvv;
X.pb(vvv);
for(int j = 0;j<n;j++){
vector<vector<int>>vv;
X[i].pb(vv);
for(int k = 0;k<n;k++){
vector<int>v;
X[i][j].pb(v);
for(int l = 0;l<n;l++){
X[i][j][k].pb(arr[p1]);
p1++;
if(p1 == sz)break;
}
if(p1 == sz)break;
}
if(p1 == sz)break;
}
if(p1 == sz)break;
}
a = X.size();
b = X[0].size();
c = X[0][0].size();
d = X[0][0][0].size();
// cout<<X.size()<<" "<<X[0].size() <<" "<< X[0][0].size()<<" "<<X[0][0][0].size()<<endl;
// cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
int an = inf;
vector<int>ans;
// cout<<an<<endl;
ans.pb(an);
for(int i = min(a,n-m+1) -1;i>=0;i--){
for(int j = min(b,n-m+1) -1;j>=0;j--){
for(int k = min(c,n-m+1) -1;k>=0;k--){
for(int l = min(d,n-m+1) -1;l>=0;l--){
// an = min(an,X[i][j][k][l]);
ans.pb(sol(i,j,k,l));
}
}
}
}
reverse(all(ans));
ans.pop_back();
print(ans);
// cout<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
