#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    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];
        }
    }

    const int inf = 1e9;
    K = min(K, N + M);
    vector<vector<vector<int>>> dp(N, vector<vector<int>>(M, vector<int>(K + 1)));
    dp[0][0][0] = A[0][0];
    if (K >= 1) dp[0][0][1] = inf;

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            for (int k = 0; k <= K; k++) {
                if (i + 1 < N) {
                    dp[i + 1][j][k] = max(dp[i + 1][j][k], min(dp[i][j][k], A[i + 1][j]));
                    if (k < K) dp[i + 1][j][k + 1] = max(dp[i + 1][j][k + 1], dp[i][j][k]);
                }
                if (j + 1 < M) {
                    dp[i][j + 1][k] = max(dp[i][j + 1][k], min(dp[i][j][k], A[i][j + 1]));
                    if (k < K) dp[i][j + 1][k + 1] = max(dp[i][j + 1][k + 1], dp[i][j][k]);
                }
            }
        }
    }

    cout << ranges::max(dp.back().back()) << endl;
}