#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));
  vector seen(N, vector<bool>(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;

    auto DFS = [&](auto DFS, int Y, int X, int Count) -> bool {
      if (A.at(Y).at(X) < mid) Count++;
      if (Count > K) return false;
      if (Y == N - 1 && X == M - 1) return true;
      seen.at(Y).at(X) = true;
      bool ret;
      for (int i = 0; i < 4; i++) {
        int NY = Y + dy.at(i), NX = X + dx.at(i);
        if (NY == N || NY < 0 || NX == M || NX < 0 || seen.at(NY).at(NX)) continue;
        ret = DFS(DFS, NY, NX, Count);
        if (ret) return true;
        seen.at(NY).at(NX) = false;
      }
      return ret;
    };

    if (DFS(DFS, 0, 0, 0)) ok = mid;
    else ng = mid;
  }

  cout << ok << endl;
}