#include <bits/stdc++.h>

using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define fi first
#define se second
#define pb push_back
#define endl '\n'
int n, k;
int me;
int A[808][808];
int B[808][808];
vector<int> w;
vector<int> v;
bool check(int x){

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            B[i][j] = B[i-1][j] + B[i][j-1] - B[i-1][j-1] + (A[i][j] <= x);

            if(i >= k && j >= k){
                //cout << i << " "<<j<<" "<<x <<" "<< B[i][j] + B[i-k][j-k] - B[i-k][j] - B[i][j-k] << "\n";
                if(B[i][j] + B[i-k][j-k] - B[i-k][j] - B[i][j-k] >= me) {


                    return true;
                }
            }
        }
    }
    return false;
}
signed main() {
    sc(n)
    sc(k)
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            sc(A[i][j])
            v.pb(A[i][j]);
        }
    }

    if (n == k) {
        sort(v.begin(), v.end());
        cout << v[n * n - n * n / 2 - 1];
        return 0;
    }
    int ans = -1;
    v.clear();
    for (int i = 1; i <= k; i++) {
        for (int j = 1; j <= k; j++) {
            v.pb(A[i][j]);
        }
    }
    sort(v.begin(),v.end());
    me = k * k - k * k / 2;
    ans = v[k * k - k * k / 2 - 1];
    int l = 0, r = ans;

    while(l < r){
        int mid = (l+r)/2;
        if(check(mid)){
            r = mid;
        }else {
            l = mid + 1;
        }
    }
    ans = l;
    cout << ans << '\n';


}
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define For(i,k,j) for(int i=(k);i<=(j);i++)
#define Foe(i,u) for(int i=lst[u],v=e[i].v;i;i=e[i].nxt,v=e[i].v)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define Fin(s) freopen(s,"r",stdin)
#define Fout(s) freopen(s,"w",stdout)
#define file(s) Fin(s".in"),Fout(s".out")
#define INF ((1<<30)-1)
//#define int long long
const int P=998244353; //
using namespace std;
template<typename T>inline void ckmax(T &a,T b) {(a<b)&&(a=b);}
template<typename T>inline void ckmin(T &a,T b) {(a>b)&&(a=b);}
inline int mul(int a,int b) {return 1ull*a*b%P;}
inline int add(int a,int b) {return a+b>=P?a+b-P:a+b;}
inline int sub(int a,int b) {return a-b>=0?a-b:a-b+P;}
inline void mulmod(int &a,int b) {a=mul(a, b);}
inline void addmod(int &a,int b) {((a+=b)>=P)&&(a-=P);}
inline void submod(int &a,int b) {((a-=b)<0)&&(a+=P);}
inline int ksm(int a,int b) {int ans=1; for(;b;b>>=1) {if(b&1) ans=1ll*ans*a%P;a=1ll*a*a%P;}return ans;}
inline void fprint(const int &x,char c=' ') {fprintf(stderr,"%d%c",x,c);}
inline void fprint(const pii &x,char c='\n') {fprintf(stderr,"%d %d%c",x.first,x.second,c);}
inline void fprint(const int *f,const int &n,char c='\n') {for(int i=1;i<=n;i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline void fprint(const vector<int> &f,char c='\n') {for(int i=0;i<(int)f.size();i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline int inv(int a) {return ksm(a,P-2);}
namespace FastIO {
  const int SIZE=1<<16; char buf[SIZE],obuf[SIZE],str[64]; int bi=SIZE,bn=SIZE,opt;
  int read(char *s) {
    while (bn) {for (;bi<bn&&buf[bi]<=' ';bi++);if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}
    int sn=0;while (bn) {for (;bi<bn&&buf[bi]>' ';bi++) s[sn++]=buf[bi];if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}s[sn]=0;return sn;
  }
  bool read(int& x) {if(x)x=0;int bf=0,n=read(str); if(!n) return 0; int i=0; if (str[i]=='-') bf=1,i=1; for(x=0;i<n;i++) x=x*10+str[i]-'0'; if(bf) x=-x; return 1;}
  void write(int x) {
    if(!x) obuf[opt++]='0'; else {if(x<0) obuf[opt++]='-',x=-x;int sn=0; while(x)str[sn++]=x%10+'0',x/=10;for (int i=sn-1;i>=0;i--) obuf[opt++]=str[i];}
    if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}
  }
  void write(char x) {obuf[opt++]=x;if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}}
	void Fflush() {if (opt) fwrite(obuf,1,opt,stdout); opt=0;}
};
inline int read() {int x; FI(x); return x;}
int A,B;
signed main() {
	#ifndef ONLINE_JUDGE
		freopen("pro.in","r",stdin);
		freopen("pro.out","w",stdout);
	#endif
	A=read(),B=read();
	if(A>B) {
		int sa=0,sb=0;
		For(i,1,A) printf("%d ",i),sa+=i;
		For(i,1,B-1) printf("%d ",-i),sb+=i;
		printf("%d\n",-(sa-sb));
	} else {
		int sa=0,sb=0;
		For(i,1,A-1) printf("%d ",i),sa+=i;
		For(i,1,B) printf("%d ",-i),sb+=i;
		printf("%d\n",(sb-sa));
	}
	return FastIO::Fflush(),0; 
}
/*

*/