#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W, P, Q;
ll a[510][510], X, maxn = -1;
bool flag[510][510];
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
bool mm(int x, int y) {
	if (y / X > x) {
		return true;
	}
	if (y / X == x && y % X > 0) {
		return true;
	} else {
		return false;
	}
}
void dfs(int x, int y, int sum) {
	if (maxn < sum) maxn = sum;
	for (int i = 0; i < 4; i++) {
		int xx = x + dx[i];
		int yy = y + dy[i];
		if (xx >= 1 && xx <= H && yy >= 1 && yy <= W && mm(a[xx][yy], sum) && !flag[xx][yy]) {
			flag[xx][yy] = 1;
			dfs(xx, yy, sum + a[xx][yy]);
			dfs(x, y, sum + a[xx][yy]);
			flag[xx][yy] = 0;
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin >> H >> W >> X >> P >> Q;
	for (int i = 1; i <= H; i++) {
		for (int j = 1; j <= W; j++) {
			cin >> a[i][j];
		}
	}
	flag[P][Q] = 1;
	dfs(P, Q, a[P][Q]);
	cout << maxn;
	return 0;
}

记录