#include <cstdio>

#include <iostream>

#include <cctype>

#include <algorithm>

#include <cmath>

#include <cstring>

using namespace std;

#define clr(x) memset(x,0,sizeof(x))

#define int long long

inline int read(){

    int s=;bool flag=true;char ch=getchar();

    while(!isdigit(ch)){if(ch=='-')flag=false;ch=getchar();}

    while(isdigit(ch)){s=(s<<)+(s<<)+ch-'';ch=getchar();}

    return flag?s:-s;

}

inline void out_put(int x){

    if(x<)    putchar('-'),x=-x;

    if(x>)    out_put(x/);

    putchar(x%+'');

}

inline void print(int x){out_put(x),puts("");}

const int N=;

const int inf=0x3f3f3f3f3f3f3f3f3f;

bool vis[N],line[N][N];

int row[N],w[N][N];

int n,m,k;

inline bool find(int x){

    for(int i=;i<=m;i++)

        if(line[x][i] && !vis[i]){

            vis[i]=true;

            if(!row[i] || find(row[i])){

                row[i]=x;

                return true;

            }

        }

    return false;

}

inline void rebuild(int limit){

    clr(line),clr(row);

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)

            if(w[i][j]<=limit)

                line[i][j]=true;

}

inline bool check(int x){

    rebuild(x);

    int cnt=;

    for(int i=;i<=n;i++){

        clr(vis);

        if(find(i))    cnt++;

    }

    if(cnt>n-k)    return true;

    return false;

}

signed main(void){

    n=read(),m=read(),k=read();

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)

            w[i][j]=read();

    int l=,r=inf,ans;

    while(l<=r){

        int mid=(l+r)>>;

        if(check(mid))r=mid-,ans=mid;

        else l=mid+;

    }

    print(ans);

    return ;

}