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

int main() {
  int N, M, K, ok = 0, ng = 1e9 + 1; cin >> N >> M >> K;
  vector<int> dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
  vector A(N, vector<int>(M));

  for (int i = 0; i < N; i++)
    for (int j = 0; j < M; j++)
      cin >> A.at(i).at(j);

  while (ng - ok > 1) {
    int mid = (ng + ok) / 2;
    vector Score(N, vector<int>(M, -1));
    deque<pair<int, int>> DQ;
    Score.at(0).at(0) = A.at(0).at(0) < mid ? 1 : 0;
    DQ.push_back({0, 0});

    while (!DQ.empty()) {
      pair<int, int> v = DQ.front();
      DQ.pop_front();
      for (int i = 0; i < 4; i++) {
        int Y = v.first + dy.at(i), X = v.second + dx.at(i);
        if (Y == N || Y < 0 || X == M || X < 0 || Score.at(Y).at(X) != -1) continue;
        if (A.at(Y).at(X) >= mid) {
          Score.at(Y).at(X) = Score.at(v.first).at(v.second);
          DQ.push_front({Y, X});
        }
        else {
          Score.at(Y).at(X) = Score.at(v.first).at(v.second) + 1;
          DQ.push_back({Y, X});
        }
      }
    }

    if (Score.at(N - 1).at(M - 1) <= K) ok = mid;
    else ng = mid;
  }

  cout << ok << endl;
}