#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

int main()
{
  const int inf = (1LL << 30);
  int n, m, k;
  cin >> n >> m >> k;
  const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
  vector<vector<int>> a(n, vector<int> (m));
  for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> a[i][j];
  int l = 1, r = 1e9 + 1;
  while (r - l > 1)
  {
    int mid = (l + r) / 2;
    deque<pair<int, int>> dq;
    vector<vector<int>> dis(n, vector<int> (m, inf));
    dis[0][0] = (a[0][0] < mid);
    for (dq.push_front({0, 0}); !dq.empty();)
    {
      auto [x, y] = dq.front();
      dq.pop_front();
      for (int i = 0; i < 4; ++i)
      {
        unsigned nx = x + dx[i], ny = y + dy[i];
        if (nx >= n || ny >= m || dis[nx][ny] != inf) continue;
        if (a[nx][ny] < mid)
        {
          dis[nx][ny] = dis[x][y] + 1;
          dq.push_back({nx, ny});
        }
        else
        {
          dis[nx][ny] = dis[x][y];
          dq.push_front({nx, ny});
        }
      }
    }
    (dis[n - 1][m - 1] <= k ? l : r) = mid;
  }
  cout << l << endl;
}