#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m, k; cin >> n >> m >> k;
  vector a(n, vector(m, 0));
  for (vector<int>& a_i : a) for (int& a_ij : a_i) cin >> a_ij;
  int ans = 1;
  for (int ub = 1000000001; ub - ans > 1;) {
    const int mid = midpoint(ans, ub);
    vector dist(n, vector(m, INF));
    dist[0][0] = (a[0][0] < mid ? 1 : 0);
    for (deque<pair<int, int>> que({{0, 0}}); !que.empty();) {
      const auto [y, x] = que.front();
      que.pop_front();
      REP(k, 4) {
        const int ny = y + DY4[k], nx = x + DX4[k];
        if (0 <= ny && ny < n && 0 <= nx && nx < m && chmin(dist[ny][nx], dist[y][x] + (a[ny][nx] < mid ? 1 : 0))) {
          if (a[ny][nx] < mid) {
            que.emplace_back(ny, nx);
          } else {
            que.emplace_front(ny, nx);
          }
        }
      }
    }
    (dist[n - 1][m - 1] <= k ? ans : ub) = mid;
  }
  cout << ans << '\n';
  return 0;
}