#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(obj) rbegin(obj), rend(obj)
#define cinv(a) rep(i, (int)a.size()) cin >> a[i]
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<Pi> vp;
typedef vector<vp> vvp;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;

template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, 1, 0, -1};
const int MOD =	1e9 + 7;
const int INF = 1e9 + 9;
const ll LINF = 1e18;
const long double eps = 1e-10;
const char nl = '\n';

ll power(ll a, ll b) { return b ? power(a * a % MOD, b / 2) * (b % 2 ? a : 1) % MOD : 1; }

ll nCk(int n, int k)
{
	ll x = 1, y = 1;
	for (int i = 1; i <= k; ++i)
	{
		x = x * (n - i + 1) % MOD;
		y = y * i % MOD;
	}
	return x * power(y, MOD - 2) % MOD;
}

struct UF
{
	vi d;
	UF(int n) : d(n, -1) {}
	int root(int x)
	{
		if (d[x] < 0)
			return x;
		return d[x] = root(d[x]);
	}
	bool unite(int x, int y)
	{
		x = root(x); y = root(y);
		if (x == y) return false;
		if (d[x] > d[y]) swap(x, y);
		d[x] += d[y];
		d[y] = x;
		return true;
	}
	bool same(int x, int y) { return root(x) == root(y); }
	int size(int x) { return -d[root(x)]; }
};

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout<<fixed<<setprecision(20);	
	int n, k; cin >> n >> k;	
	vvi A(n, vi(n));
	rep(i, n) rep(j, n) cin >> A[i][j];

	int lim = k*k/2 + 1;
	int ng = INF;
	int ok = -1;

	auto check = [&](int x) -> bool
	{
		vvi S(n+1, vi(n+1));
		rep(i, n) rep(j, n)
			S[i+1][j+1] = S[i][j+1] + S[i+1][j] - S[i][j] + (A[i][j] >= x);
		int cnt = 0;
		int m = n-k+1;
		rep(i, m) rep(j, m)
			cnt += S[i+k][j+k] - S[i+k][j] - S[i][j+k] + S[i][j] >= lim;
		return cnt == m*m;
	};
	while (ng - ok > 1)
	{
		int mid = (ok + ng)/2;
		if (check(mid)) ok = mid;
		else ng = mid;
	}
	cout << ok << nl;
}	
	

#include <bits/stdc++.h>
#define int long long
using namespace std;

int32_t main(){

    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin>>n;
    string s; cin>>s;

    string t; 
    while((int)t.size() < n+2) t+="110";

    int ans=0;
    for(int i=0;i<3;i++){
        if(s!=t.substr(i, n)) continue;
        ans+=(int)1e10-(n+i-1)/3;
    }
    cout<<ans;
    return 0;
}