import sys
import itertools
from heapq import *
from functools import lru_cache

# 定数の設定
SMALLMOD = 998244353
BIGMOD = 1000000007
PI = 3.141592653589793
ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alphabet = "abcdefghijklmnopqrstuvwxyz"
dx = [1, 0, -1, 0, 1, -1, -1, 1]
dy = [0, 1, 0, -1, 1, 1, -1, -1]

def main():
    # 入力の受け取り
    n, m, k = map(int, sys.stdin.readline().split())
    mp = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
    
    # dp配列の初期化
    dp = [[[] for _ in range(m)] for _ in range(n)]
    dp[0][0] = [mp[0][0]]

    # 最初の列のdpを更新
    for i in range(1, n):
        tmp = dp[i - 1][0] + [mp[i][0]]
        tmp.sort()
        dp[i][0] = tmp

    # 最初の行のdpを更新
    for j in range(1, m):
        tmp = dp[0][j - 1] + [mp[0][j]]
        tmp.sort()
        dp[0][j] = tmp

    # dp配列の更新
    for i in range(1, n):
        for j in range(1, m):
            tmp1 = dp[i - 1][j] + [mp[i][j]]
            tmp2 = dp[i][j - 1] + [mp[i][j]]
            tmp1.sort()
            tmp2.sort()
            t1 = min(tmp1[k-1:]) if k <= len(tmp1) else float('inf')
            t2 = min(tmp2[k-1:]) if k <= len(tmp2) else float('inf')
            dp[i][j] = tmp1 if t1 > t2 else tmp2

    # 最後のdpの要素を取得して、最小値を出力
    last = dp[-1][-1]
    last.sort()
    for i in range(k):
        if i < len(last):
            last[i] = float('inf')
    print(1000000000 if min(last)==float("inf") else min(last))

if __name__ == "__main__":
    main()