use std::collections::BinaryHeap;

use proconio::input;

fn main() {
  input! {
    n: usize,
    m: usize,
    k: usize,
    a: [[u64; m]; n],
  }

  let e9 = 10u64.pow(9);

  if k >= n + m - 1 {
    println!("{}", e9);
    return;
  }

  let mut visited = vec![vec![vec![false; k + 1]; m]; n];
  let mut p_queue = BinaryHeap::new();
  p_queue.push((a[0][0], 0, 0, 0));

  if k > 0 && a[0][0] < e9 {
    p_queue.push((e9, 0, 0, 1));
  }

  while let Some((cs, ci, cj, ck)) = p_queue.pop() {
    if visited[ci][cj][ck] {
      continue;
    } else if (n - ci) + (m - cj) - 2 <= k - ck {
      println!("{}", cs);
      return;
    }
    visited[ci][cj][ck] = true;

    for (di, dj) in [(-1, 0), (1, 0), (0, -1), (0, 1)] {
      let ni = ci as isize + di;
      let nj = cj as isize + dj;
      if ni < 0 || n <= ni as usize || nj < 0 || m <= nj as usize {
        continue;
      }
      let ni = ni as usize;
      let nj = nj as usize;

      if k > ck && a[ni][nj] < e9 {
        p_queue.push((cs, ni, nj, ck + 1));
      }
      p_queue.push((cs.min(a[ni][nj]), ni, nj, ck));
    }
  }

}