#include <bits/stdc++.h>

void solve() {
  int d[] = {1, 0, -1, 0, 1};
  int N, M, K; std::cin >> N >> M >> K;
  std::vector A(N, std::vector<int>(M));
  for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) std::cin >> A[i][j];
  if (N+M-1 <= K) {
    std::cout << (int)1e9 << std::endl;
    return;
  }
  std::vector pq(N, std::vector<std::priority_queue<int>>(M));
  std::vector vis(N, std::vector<bool>(M, false));
  pq[0][0].push(A[0][0]);
  vis[0][0] = true;
  for (int x = 0; x < N; x++) for (int y = 0; y < M; y++) {
    for (int i = 0; i < 4; i++) {
      int nx = x+d[i], ny = y+d[i+1];
      if (nx < 0 || nx >= N || ny < 0 || ny >= M) continue;
      std::priority_queue<int> q = pq[x][y];
      q.push(A[nx][ny]);
      while ((int)q.size() > K+1) q.pop();
      if (vis[nx][ny]) {
        int pre = pq[nx][ny].top(), tmp = q.top();
        if (pre < tmp) pq[nx][ny] = q;
      }
      else pq[nx][ny] = q;
      vis[nx][ny] = true;
    }
  }
  std::cout << pq[N-1][M-1].top() << std::endl;
}

int main() {
  std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

  int testcases = 1;
  //std::cin >> testcases;
  for (;testcases--;) solve();

  return 0;
}