#include <bits/stdc++.h>

using namespace std;

#define maxn 300

#define maxque 666666

#define INF 0x3f3f3f3f

int n,m,k,ai[maxn][maxn],E[maxque],V[maxque],head[maxn*maxn*],cnt,s,t;

int F[maxque],deep[maxn*maxn*],que[maxque<<];

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'')Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

inline void edge_add(int u,int v,int f)

{

    E[++cnt]=head[u],V[cnt]=v,F[cnt]=f,head[u]=cnt;

    E[++cnt]=head[v],V[cnt]=u,F[cnt]=,head[v]=cnt;

}

inline bool bfs()

{

    for(int i=s;i<=t;i++) deep[i]=-;

    int h=,tail=,now;deep[s]=,que[h]=s;

    while(h<tail)

    {

        now=que[h++];

        for(int i=head[now];i;i=E[i])

        {

            if(F[i]&&deep[V[i]]<)

            {

                deep[V[i]]=deep[now]+;

                if(V[i]==t) return true;

                que[tail++]=V[i];

            }

        }

    }

    return false;

}

inline int flowing(int now,int flow)

{

    if(now==t||flow<=) return flow;

    int oldflow=;

    for(int i=head[now];i;i=E[i])

    {

        if(!F[i]||deep[V[i]]!=deep[now]+) continue;

        int pos=flowing(V[i],min(flow,F[i]));

        F[i]-=pos,flow-=pos,oldflow+=pos,F[i^]+=pos;

        if(!flow) return oldflow;

    }

    if(!oldflow) deep[now]=-;

    return oldflow;

}

bool check(int lit)

{

    cnt=,s=,t=n+m+maxn*maxn+;

    for(int i=s;i<=t;i++) head[i]=;

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

    {

        edge_add(s,i,);

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

        {

            if(ai[i][v]<=lit)

            {

                edge_add(i,i*m+v-m,INF);

                edge_add(i*m+v-m,v+n,INF);

            }

        }

    }

    for(int i=;i<=m;i++) edge_add(i+n,t,);

    int pos=;

    while(bfs()) pos+=flowing(s,INF);

    return pos>=k;

}

int main()

{

    in(n),in(m),in(k),k=n-k+;

    int l=,r=,mid,ans=;

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

        for(int v=;v<=m;v++) in(ai[i][v]),r=max(ai[i][v],r);

    while(l<=r)

    {

        mid=l+r>>;

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

        else l=mid+;

    }

    cout<<ans;

    return ;

}