#![allow(non_snake_case, unused_must_use, unused_imports)]
use std::io::{self, prelude::*};

fn main() {
    let (stdin, stdout) = (io::read_to_string(io::stdin()).unwrap(), io::stdout());
    let (mut stdin, mut buffer) = (stdin.split_whitespace(), io::BufWriter::new(stdout.lock()));
    macro_rules! input {
        ($t: ty, $n: expr) => {
            (0..$n).map(|_| input!($t)).collect::<Vec<_>>()
        };
        ($t: ty) => {
            stdin.next().unwrap().parse::<$t>().unwrap()
        };
    }

    let N = input!(usize);
    let M = input!(usize);
    let K = input!(usize);
    let A = {
        let mut a = vec![];

        for _ in 0..N {
            let r = input!(u32, M);
            a.push(r);
        }

        a
    };

    if N + M - 2 <= K {
        writeln!(buffer, "1000000000");
        return;
    }

    // 頑張って K 個保持して dp で云々みたいに考えていたが、二分探索でいける説
    let mut ok = 0;
    let mut ng = 1_000_000_001;

    while ng - ok > 1 {
        let m = (ok + ng) / 2;

        let mut dp = vec![vec![u16::MAX; M]; N];
        dp[0][0] = if A[0][0] < m { 1 } else { 0 };

        for y in 0..N {
            for x in 0..M {
                if x == 0 && y == 0 {
                    continue;
                }

                if x > 0 {
                    dp[y][x] =
                        std::cmp::min(dp[y][x], dp[y][x - 1] + if A[y][x] < m { 1 } else { 0 });
                }

                if y > 0 {
                    dp[y][x] =
                        std::cmp::min(dp[y][x], dp[y - 1][x] + if A[y][x] < m { 1 } else { 0 });
                }
            }
        }

        if dp[N - 1][M - 1] <= K as u16 {
            ok = m;
        } else {
            ng = m;
        }
    }

    writeln!(buffer, "{}", ok);
}