/*＿＿＿＿＿＿
　　 ||　　　　  　|
　　 ||ACはこちらへ|
　　 ||　　　　  　|
　　 ||￣￣￣￣￣￣ 
∧_∧||
(`･ω･||
（ つ||０
　uｰu*/
#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(ll i = 0; i < n; ++i)
using ll = long long ;
const ll INF = (1ll << 29);
const ll inf = INF*INF;
#define rall(x) (x).rbegin(),(x).rend()
int main(){
	ll n,m,c,x;
    cin >> n >> m >> c >> x;
    vector<vector<ll>> a(n,vector<ll>(m));
	rep(i,n) rep(j,m) cin >> a[i][j];
	auto up2 = [&](vector<tuple<ll,ll,ll>> &vp,ll d,ll id,ll &a){
		vp.emplace_back(d,a,id);
		sort(rall(vp));
		if(vp.size()>=3) vp.pop_back();
		return;
	};
	auto chmax = [&](ll &a, ll b){
		a = max(a,b);
		return;
	};
	auto sol = [&](ll mi){
		bool flag = false;
		vector<vector<vector<ll>>> dp(n,vector<vector<ll>>(m,vector<ll>(2,-inf)));
		rep(st,m) if(a[0][st]>=mi) dp[0][st][0] = 0;
		rep(i,n-1){
			vector<tuple<ll,ll,ll>> vp;
			rep(j,m)rep(t,2)  up2(vp,dp[i][j][t],j,a[i][j]);
			rep(j,m) {
				// f = 0
				for(auto k:vp){
				ll lj,d;
				tie(d,ignore,lj) = k;
				if(j != lj && a[i+1][j]>=mi && a[i][lj]>= mi) chmax(dp[i+1][j][0],d);
				}
				// f = 1
				if(min(a[i+1][j],a[i][j])>=mi+c) rep(t,2){
					chmax(dp[i+1][j][1],dp[i][j][t]+2-t);
				}
			}
		}
		rep(i,m)rep(t,2) flag |= (dp[n-1][i][t]>=x); 
		return flag;
	};
	auto tansaku = [&](){
    	ll ok = -inf,ng = inf;
    	while(abs(ok-ng) > 1){
        	ll mid = (ok + ng)/2;
			// ll mid = l + (r-l)/2;
        	if(sol(mid)) ok = mid;
        	else ng = mid;
	  	}
		return ok;
	};
	sol(94051);
	cout << tansaku() << endl;
}